java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:38:33,960 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:38:33,962 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:38:33,973 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:38:33,974 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:38:33,975 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:38:33,976 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:38:33,978 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:38:33,980 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:38:33,981 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:38:33,982 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:38:33,982 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:38:33,983 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:38:33,984 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:38:33,985 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:38:33,986 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:38:33,987 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:38:33,989 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:38:33,991 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:38:33,993 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:38:33,994 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:38:33,995 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:38:33,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:38:33,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:38:33,998 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:38:33,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:38:34,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:38:34,001 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:38:34,002 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:38:34,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:38:34,004 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:38:34,005 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:38:34,005 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:38:34,005 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:38:34,006 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:38:34,007 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:38:34,007 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-20 10:38:34,021 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:38:34,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:38:34,022 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:38:34,022 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:38:34,023 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:38:34,023 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:38:34,023 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:38:34,023 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:38:34,024 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:38:34,024 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-20 10:38:34,024 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-20 10:38:34,024 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:38:34,025 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:38:34,025 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:38:34,026 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:38:34,026 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:38:34,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:38:34,026 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:38:34,027 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:38:34,029 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:38:34,030 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:38:34,030 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:38:34,030 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:38:34,030 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:38:34,030 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:38:34,031 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:38:34,031 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:38:34,031 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:38:34,031 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:38:34,031 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:38:34,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:38:34,032 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:38:34,032 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:38:34,032 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:38:34,032 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:38:34,033 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:38:34,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:38:34,034 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:38:34,035 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:38:34,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:38:34,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:38:34,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:38:34,098 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:38:34,099 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:38:34,099 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-01-20 10:38:34,100 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-01-20 10:38:34,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:38:34,135 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:38:34,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:38:34,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:38:34,136 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:38:34,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:34" (1/1) ... [2019-01-20 10:38:34,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:34" (1/1) ... [2019-01-20 10:38:34,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:38:34,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:38:34,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:38:34,200 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:38:34,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:34" (1/1) ... [2019-01-20 10:38:34,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:34" (1/1) ... [2019-01-20 10:38:34,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:34" (1/1) ... [2019-01-20 10:38:34,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:34" (1/1) ... [2019-01-20 10:38:34,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:34" (1/1) ... [2019-01-20 10:38:34,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:34" (1/1) ... [2019-01-20 10:38:34,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:34" (1/1) ... [2019-01-20 10:38:34,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:38:34,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:38:34,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:38:34,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:38:34,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:34" (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 [2019-01-20 10:38:34,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:38:34,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:38:34,577 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:38:34,577 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-20 10:38:34,579 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:38:34 BoogieIcfgContainer [2019-01-20 10:38:34,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:38:34,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:38:34,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:38:34,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:38:34,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:34" (1/2) ... [2019-01-20 10:38:34,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b74167f and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:38:34, skipping insertion in model container [2019-01-20 10:38:34,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:38:34" (2/2) ... [2019-01-20 10:38:34,588 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-01-20 10:38:34,600 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:38:34,609 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-20 10:38:34,634 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-20 10:38:34,701 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:38:34,701 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:38:34,701 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:38:34,701 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:38:34,701 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:38:34,702 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:38:34,702 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:38:34,702 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:38:34,716 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-20 10:38:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:38:34,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:34,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:38:34,728 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:34,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:34,736 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-20 10:38:34,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:34,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:34,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:34,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:34,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:38:34,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:34,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:34,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:34,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:34,933 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-20 10:38:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:35,168 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-20 10:38:35,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:35,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:38:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:35,184 INFO L225 Difference]: With dead ends: 25 [2019-01-20 10:38:35,184 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 10:38:35,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 10:38:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-20 10:38:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 10:38:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-20 10:38:35,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-20 10:38:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:35,227 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-20 10:38:35,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-20 10:38:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:35,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:35,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:35,229 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:35,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:35,230 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-20 10:38:35,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:35,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:35,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:35,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:35,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:35,561 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-01-20 10:38:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:35,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:35,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:35,585 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:35,587 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-20 10:38:35,663 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:35,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:36,578 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:36,580 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:36,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:36,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:36,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:36,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:36,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:36,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:36,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:36,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:37,100 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-20 10:38:37,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:37,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:37,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:37,280 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-20 10:38:37,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:37,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:37,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:37,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:37,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:37,304 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:37,330 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:37,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:37,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:38:37,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:38:37,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:38:37,558 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:38:37,668 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-01-20 10:38:37,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:38:37,671 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:37,968 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:38,194 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:38,318 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:38,352 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:38,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:38,388 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-20 10:38:38,567 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-20 10:38:38,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:38,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:38:38,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:38,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:38,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:38,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:39,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:39,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:38:39,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:39,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:38:39,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:38:39,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:39,068 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-20 10:38:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:39,446 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-20 10:38:39,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:38:39,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:38:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:39,449 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:38:39,449 INFO L226 Difference]: Without dead ends: 37 [2019-01-20 10:38:39,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:38:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-20 10:38:39,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-20 10:38:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 10:38:39,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-20 10:38:39,456 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-20 10:38:39,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:39,456 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-20 10:38:39,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:38:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-20 10:38:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:39,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:39,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:39,458 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:39,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:39,458 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-20 10:38:39,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:39,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:39,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:39,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:39,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:39,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:39,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:39,554 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:39,555 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-20 10:38:39,557 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:39,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:42,647 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:42,647 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:42,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:42,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:42,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:42,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:42,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:42,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:42,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:42,837 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-20 10:38:42,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:42,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:43,028 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-20 10:38:43,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:43,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:43,107 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,119 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:38:43,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:38:43,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:38:43,209 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:38:43,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:38:43,223 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,257 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,295 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,309 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,332 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:43,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:43,398 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-20 10:38:43,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:43,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:38:43,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-20 10:38:43,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-20 10:38:43,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:231 [2019-01-20 10:38:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:43,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:43,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:38:43,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:38:43,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:43,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:38:43,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:38:43,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:38:43,940 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-20 10:38:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:43,994 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-20 10:38:43,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:43,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:38:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:43,997 INFO L225 Difference]: With dead ends: 18 [2019-01-20 10:38:43,997 INFO L226 Difference]: Without dead ends: 17 [2019-01-20 10:38:43,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:38:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-20 10:38:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-20 10:38:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:38:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-20 10:38:44,001 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-20 10:38:44,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:44,002 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-20 10:38:44,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:38:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-20 10:38:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:44,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:44,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:44,003 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:44,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:44,003 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-20 10:38:44,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:44,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:44,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:44,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:44,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:44,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:44,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:38:44,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:44,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:44,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:44,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:44,042 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-20 10:38:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:44,091 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-20 10:38:44,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:44,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:38:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:44,092 INFO L225 Difference]: With dead ends: 21 [2019-01-20 10:38:44,093 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 10:38:44,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 10:38:44,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-20 10:38:44,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:38:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-20 10:38:44,098 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-20 10:38:44,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:44,098 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-20 10:38:44,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-20 10:38:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:44,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:44,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:44,100 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:44,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:44,100 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-20 10:38:44,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:44,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:44,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:44,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:44,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:44,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:44,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:44,190 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:44,190 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-20 10:38:44,195 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:44,195 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:44,455 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:44,456 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:44,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:44,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:44,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:44,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:44,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:44,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:44,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:44,654 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-20 10:38:44,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:38:44,684 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 21 treesize of output 27 [2019-01-20 10:38:44,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:44,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:44,748 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 23 treesize of output 37 [2019-01-20 10:38:44,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:44,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:44,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:44,818 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:38:44,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:38:44,919 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,213 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:45,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:45,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:45,734 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,743 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,753 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:45,776 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-20 10:38:45,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:45,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:38:45,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:45,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:45,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:45,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:45,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:45,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:38:45,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:45,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:38:45,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:38:45,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:45,879 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-20 10:38:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:46,075 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-20 10:38:46,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:38:46,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:38:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:46,080 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:38:46,080 INFO L226 Difference]: Without dead ends: 38 [2019-01-20 10:38:46,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:38:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-20 10:38:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-20 10:38:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 10:38:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-20 10:38:46,085 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-20 10:38:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:46,085 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-20 10:38:46,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:38:46,085 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-20 10:38:46,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:46,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:46,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:46,086 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:46,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:46,086 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-20 10:38:46,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:46,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:46,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:46,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:46,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:46,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:46,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:46,173 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:46,173 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-20 10:38:46,174 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:46,175 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:46,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:46,615 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:46,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:46,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:46,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:46,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:46,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:46,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:46,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:46,812 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-20 10:38:46,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:38:46,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 21 treesize of output 27 [2019-01-20 10:38:46,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,825 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 23 treesize of output 37 [2019-01-20 10:38:46,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:46,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:38:46,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:38:46,847 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,911 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:47,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:47,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:47,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:47,157 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:47,170 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:47,181 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:47,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:47,207 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:38:47,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-20 10:38:47,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:38:47,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:38:47,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-01-20 10:38:47,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-20 10:38:47,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-20 10:38:47,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:47,693 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:38:47,695 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 45 treesize of output 51 [2019-01-20 10:38:47,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:47,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-20 10:38:47,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-01-20 10:38:47,903 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-01-20 10:38:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:47,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:47,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:47,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:38:47,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:47,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:47,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:47,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:38:47,988 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-20 10:38:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:48,513 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-01-20 10:38:48,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:38:48,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:38:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:48,516 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:38:48,516 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:38:48,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:38:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:38:48,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-01-20 10:38:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-20 10:38:48,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-01-20 10:38:48,524 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-01-20 10:38:48,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:48,524 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-01-20 10:38:48,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-01-20 10:38:48,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:48,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:48,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:48,525 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:48,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:48,526 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-20 10:38:48,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:48,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:48,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:48,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:48,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:48,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:48,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:48,573 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:48,573 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-20 10:38:48,574 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:48,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:48,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:48,798 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:48,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:48,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:48,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:48,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:48,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:48,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:48,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:48,868 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 18 treesize of output 21 [2019-01-20 10:38:48,908 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 21 treesize of output 23 [2019-01-20 10:38:48,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:48,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:38:49,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:38:49,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:38:49,115 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,136 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,160 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:38:49,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:38:49,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:38:49,238 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,246 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,255 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:49,277 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-20 10:38:49,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:49,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-20 10:38:49,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:49,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:49,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-20 10:38:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:49,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:49,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:38:49,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-20 10:38:49,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:49,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:38:49,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:38:49,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:49,397 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-01-20 10:38:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:49,515 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-01-20 10:38:49,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:49,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:38:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:49,517 INFO L225 Difference]: With dead ends: 25 [2019-01-20 10:38:49,517 INFO L226 Difference]: Without dead ends: 24 [2019-01-20 10:38:49,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-20 10:38:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-20 10:38:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 10:38:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-01-20 10:38:49,525 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-01-20 10:38:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:49,525 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-01-20 10:38:49,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:38:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-01-20 10:38:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:49,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:49,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:49,527 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-20 10:38:49,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:49,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:49,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:49,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:49,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:49,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:49,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:49,697 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:49,697 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-20 10:38:49,700 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:49,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:49,995 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:49,995 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:49,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:49,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:49,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:49,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:50,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:50,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:50,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:50,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:38:50,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:38:50,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,125 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 23 treesize of output 37 [2019-01-20 10:38:50,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,135 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:38:50,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:38:50,147 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,166 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:50,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:50,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:50,314 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,323 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,332 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:50,356 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:38:50,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:38:50,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:50,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:50,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:50,500 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:38:50,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-20 10:38:50,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:50,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:50,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-20 10:38:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:50,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:50,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:50,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:38:50,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:50,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:50,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:50,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:38:50,596 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-01-20 10:38:51,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:51,048 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-01-20 10:38:51,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:38:51,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:38:51,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:51,050 INFO L225 Difference]: With dead ends: 56 [2019-01-20 10:38:51,051 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:38:51,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:38:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:38:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-01-20 10:38:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-20 10:38:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-01-20 10:38:51,059 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-01-20 10:38:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:51,059 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-01-20 10:38:51,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-01-20 10:38:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:51,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:51,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:51,060 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:51,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:51,060 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-01-20 10:38:51,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:51,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:51,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:51,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:51,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:51,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:51,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:51,128 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:51,128 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-01-20 10:38:51,130 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:51,130 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:51,431 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:51,432 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:51,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:51,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:51,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:51,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:51,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:51,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:51,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:51,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:51,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:51,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:51,663 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:51,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:51,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:51,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:38:51,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:38:51,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:38:51,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:38:51,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:38:51,742 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:51,761 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:51,776 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:51,788 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:51,798 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:51,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:51,828 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:38:51,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:38:51,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:51,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:51,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:51,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:51,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:38:51,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:52,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:52,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:38:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:52,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:52,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:52,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:38:52,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:52,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:52,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:52,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:38:52,083 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-01-20 10:38:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:52,451 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-01-20 10:38:52,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:38:52,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:38:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:52,453 INFO L225 Difference]: With dead ends: 52 [2019-01-20 10:38:52,453 INFO L226 Difference]: Without dead ends: 48 [2019-01-20 10:38:52,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:38:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-20 10:38:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-20 10:38:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 10:38:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-20 10:38:52,462 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-20 10:38:52,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:52,462 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-20 10:38:52,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-20 10:38:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:52,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:52,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:52,464 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:52,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-20 10:38:52,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:52,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:52,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:52,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:52,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:52,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:52,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:52,498 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:52,498 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-20 10:38:52,501 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:52,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:54,028 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:54,028 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:54,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:54,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:54,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:54,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:54,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:54,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:54,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:54,049 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 18 treesize of output 21 [2019-01-20 10:38:54,059 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 21 treesize of output 23 [2019-01-20 10:38:54,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:38:54,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:38:54,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,102 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 27 treesize of output 62 [2019-01-20 10:38:54,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,129 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:38:54,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,199 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 36 treesize of output 49 [2019-01-20 10:38:54,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:38:54,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:38:54,313 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,327 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,340 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,356 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:54,406 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-20 10:38:54,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:54,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:38:54,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:54,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:54,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-20 10:38:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:54,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:54,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:54,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:38:54,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:54,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:38:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:38:54,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:38:54,543 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-01-20 10:38:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:54,719 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-01-20 10:38:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:38:54,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:38:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:54,720 INFO L225 Difference]: With dead ends: 42 [2019-01-20 10:38:54,720 INFO L226 Difference]: Without dead ends: 41 [2019-01-20 10:38:54,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:38:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-20 10:38:54,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-01-20 10:38:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 10:38:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-20 10:38:54,729 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-20 10:38:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:54,729 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-20 10:38:54,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:38:54,730 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-20 10:38:54,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:54,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:54,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:54,730 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:54,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:54,731 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-20 10:38:54,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:54,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:54,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:54,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:54,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:54,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:54,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:54,848 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:54,849 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-20 10:38:54,850 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:54,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:55,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:55,463 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:55,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:55,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:55,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:55,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:55,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:55,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:55,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:55,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:38:55,534 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 21 treesize of output 27 [2019-01-20 10:38:55,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,543 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 23 treesize of output 37 [2019-01-20 10:38:55,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,552 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:38:55,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:38:55,565 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:55,599 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:55,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:55,633 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:55,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:55,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:38:55,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:38:55,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:38:55,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:38:55,814 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:55,832 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:55,851 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:55,869 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:55,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:55,914 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-20 10:38:55,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:38:55,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:55,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:55,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:38:55,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:55,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:38:55,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:56,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:56,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-20 10:38:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:56,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:56,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:56,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:38:56,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:56,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:56,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:56,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:38:56,098 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-01-20 10:38:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:56,514 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-01-20 10:38:56,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:38:56,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:38:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:56,516 INFO L225 Difference]: With dead ends: 54 [2019-01-20 10:38:56,516 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 10:38:56,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:38:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 10:38:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-01-20 10:38:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-20 10:38:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-01-20 10:38:56,527 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-01-20 10:38:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:56,527 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-01-20 10:38:56,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-01-20 10:38:56,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:56,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:56,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:56,528 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:56,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:56,528 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-01-20 10:38:56,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:56,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:56,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:56,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:56,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:56,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:56,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:56,620 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:56,621 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-20 10:38:56,623 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:56,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:56,858 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:56,858 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:56,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:56,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:56,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:56,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:56,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:56,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:56,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:56,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:56,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:56,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:57,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:57,015 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:57,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:57,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:57,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:38:57,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:38:57,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:38:57,095 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:38:57,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:38:57,114 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:57,148 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:57,172 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:57,188 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:57,201 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:57,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:57,230 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-20 10:38:57,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:38:57,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:57,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. [2019-01-20 10:38:57,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:57,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:57,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:38:57,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:57,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:57,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-20 10:38:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:57,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:57,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:57,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:38:57,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:57,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:57,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:38:57,444 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-01-20 10:38:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:57,741 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-01-20 10:38:57,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:38:57,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:38:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:57,744 INFO L225 Difference]: With dead ends: 63 [2019-01-20 10:38:57,744 INFO L226 Difference]: Without dead ends: 61 [2019-01-20 10:38:57,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:38:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-20 10:38:57,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-01-20 10:38:57,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:38:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-01-20 10:38:57,754 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-01-20 10:38:57,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:57,754 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-01-20 10:38:57,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-01-20 10:38:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:57,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:57,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:57,755 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:57,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:57,756 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-20 10:38:57,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:57,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:57,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:57,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:57,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:38:57,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:57,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:38:57,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:57,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:38:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:38:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:38:57,817 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-01-20 10:38:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:57,876 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-01-20 10:38:57,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:57,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:38:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:57,877 INFO L225 Difference]: With dead ends: 41 [2019-01-20 10:38:57,878 INFO L226 Difference]: Without dead ends: 40 [2019-01-20 10:38:57,878 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 [2019-01-20 10:38:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-20 10:38:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-01-20 10:38:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 10:38:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-01-20 10:38:57,888 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-01-20 10:38:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:57,888 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-01-20 10:38:57,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:38:57,889 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-01-20 10:38:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:57,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:57,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:57,890 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:57,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:57,890 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-01-20 10:38:57,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:57,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:57,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:57,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:57,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:58,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:58,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:58,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:38:58,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:38:58,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:58,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:58,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:38:58,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:38:58,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 10:38:58,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:38:58,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:58,279 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-20 10:38:58,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:38:58,289 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 21 treesize of output 27 [2019-01-20 10:38:58,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,295 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 23 treesize of output 37 [2019-01-20 10:38:58,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,303 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:38:58,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:38:58,312 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,369 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:38:58,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:38:58,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:38:58,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:38:58,530 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,547 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,564 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,581 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:58,613 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-20 10:38:58,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:38:58,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:58,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:38:58,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:58,748 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:38:58,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-20 10:38:58,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:58,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:58,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-01-20 10:38:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:58,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:58,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:58,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:38:58,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:58,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:58,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:58,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:38:58,842 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-01-20 10:38:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:59,202 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-01-20 10:38:59,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:38:59,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:38:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:59,204 INFO L225 Difference]: With dead ends: 57 [2019-01-20 10:38:59,204 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:38:59,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:38:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:38:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-01-20 10:38:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 10:38:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-01-20 10:38:59,216 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-01-20 10:38:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:59,216 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-01-20 10:38:59,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:38:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-01-20 10:38:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:38:59,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:59,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:38:59,217 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:59,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:59,217 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-20 10:38:59,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:59,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:59,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:38:59,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:59,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:59,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:59,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:59,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:38:59,268 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-20 10:38:59,269 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:59,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:59,505 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:59,505 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:38:59,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:59,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:59,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:59,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:59,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:59,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:59,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:59,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:38:59,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:38:59,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:38:59,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,643 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:38:59,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:38:59,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:38:59,679 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:38:59,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:38:59,688 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,704 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,717 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,728 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,738 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:59,761 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-20 10:38:59,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:38:59,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:59,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-20 10:38:59,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:38:59,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:38:59,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:38:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:59,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:59,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:59,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:38:59,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:59,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:38:59,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:38:59,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:38:59,915 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-01-20 10:39:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:00,250 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-01-20 10:39:00,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:00,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:39:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:00,252 INFO L225 Difference]: With dead ends: 61 [2019-01-20 10:39:00,252 INFO L226 Difference]: Without dead ends: 60 [2019-01-20 10:39:00,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-20 10:39:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-01-20 10:39:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 10:39:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-01-20 10:39:00,265 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-01-20 10:39:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:00,265 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-01-20 10:39:00,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-01-20 10:39:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:00,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:00,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:00,266 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:00,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:00,266 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-20 10:39:00,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:00,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:00,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:00,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:00,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:00,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:00,312 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:00,313 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-20 10:39:00,314 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:00,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:00,460 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:00,461 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:39:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:00,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:00,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:00,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:00,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:00,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:00,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:00,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21 [2019-01-20 10:39:00,526 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 21 treesize of output 23 [2019-01-20 10:39:00,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:39:00,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:39:00,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,584 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 27 treesize of output 62 [2019-01-20 10:39:00,584 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,609 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:39:00,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,683 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 36 treesize of output 49 [2019-01-20 10:39:00,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:39:00,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:39:00,769 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,785 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,800 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,815 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:00,902 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-20 10:39:00,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:39:00,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:00,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-20 10:39:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:00,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:00,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:00,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:39:00,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:00,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:39:00,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:39:00,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:39:00,997 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-01-20 10:39:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:01,187 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-01-20 10:39:01,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:39:01,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:39:01,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:01,189 INFO L225 Difference]: With dead ends: 53 [2019-01-20 10:39:01,189 INFO L226 Difference]: Without dead ends: 52 [2019-01-20 10:39:01,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:39:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-20 10:39:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-01-20 10:39:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 10:39:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-01-20 10:39:01,201 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-01-20 10:39:01,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:01,202 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-01-20 10:39:01,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:39:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-01-20 10:39:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:01,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:01,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:01,203 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:01,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:01,203 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-20 10:39:01,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:01,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:01,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:01,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:01,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:01,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:01,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:01,423 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:01,423 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-20 10:39:01,424 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:01,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:01,663 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:01,663 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:01,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:01,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:01,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:01,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:01,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:01,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:01,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:01,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:01,769 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 21 treesize of output 27 [2019-01-20 10:39:01,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,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 23 treesize of output 37 [2019-01-20 10:39:01,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,784 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:01,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:39:01,798 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,826 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:01,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:01,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:01,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:02,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,015 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:02,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:02,078 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,103 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,124 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,154 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:02,238 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-20 10:39:02,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:39:02,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:02,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:02,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:39:02,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:02,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-20 10:39:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:02,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:02,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:02,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:02,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:02,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:02,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:02,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:02,513 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-01-20 10:39:02,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:02,855 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-01-20 10:39:02,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:02,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:39:02,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:02,857 INFO L225 Difference]: With dead ends: 69 [2019-01-20 10:39:02,857 INFO L226 Difference]: Without dead ends: 68 [2019-01-20 10:39:02,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-20 10:39:02,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-01-20 10:39:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 10:39:02,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-01-20 10:39:02,869 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-01-20 10:39:02,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:02,869 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-01-20 10:39:02,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-01-20 10:39:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:02,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:02,870 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-20 10:39:02,870 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:02,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:02,871 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-01-20 10:39:02,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:02,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:02,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:02,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:02,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:02,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:02,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:02,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:02,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:02,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:02,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:02,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:02,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:02,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:39:02,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:02,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:03,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:03,041 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 21 treesize of output 27 [2019-01-20 10:39:03,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,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 23 treesize of output 37 [2019-01-20 10:39:03,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,052 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:03,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:39:03,062 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,264 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:03,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:03,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:03,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:03,463 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,478 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,494 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,511 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:03,543 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-01-20 10:39:03,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:03,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:03,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:03,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-01-20 10:39:03,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:03,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-01-20 10:39:03,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:39:03,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:03,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-20 10:39:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:03,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:03,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:03,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-20 10:39:03,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:03,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:39:03,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:39:03,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:39:03,887 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-01-20 10:39:04,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:04,207 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-01-20 10:39:04,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:04,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-20 10:39:04,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:04,209 INFO L225 Difference]: With dead ends: 73 [2019-01-20 10:39:04,209 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:39:04,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:39:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-01-20 10:39:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-20 10:39:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-01-20 10:39:04,224 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-01-20 10:39:04,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:04,224 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-01-20 10:39:04,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:39:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-01-20 10:39:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:04,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:04,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:04,225 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:04,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:04,226 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-20 10:39:04,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:04,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:04,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:04,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:04,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:04,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:04,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:04,345 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:04,345 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-20 10:39:04,347 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:04,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:04,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:04,586 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:04,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:04,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:04,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:04,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:04,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:04,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:04,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:04,609 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 18 treesize of output 21 [2019-01-20 10:39:04,619 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 21 treesize of output 23 [2019-01-20 10:39:04,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:39:04,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:39:04,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,676 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 27 treesize of output 62 [2019-01-20 10:39:04,676 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,701 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,726 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,758 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 43 treesize of output 39 [2019-01-20 10:39:04,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:39:04,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:39:04,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:04,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:39:04,920 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,934 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,947 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,964 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:04,991 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:39:05,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:39:05,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:05,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:05,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:39:05,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:05,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-20 10:39:05,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:05,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:05,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-01-20 10:39:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:05,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:05,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:05,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:39:05,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:05,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:05,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:05,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:05,182 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-01-20 10:39:05,630 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-20 10:39:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:05,844 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-01-20 10:39:05,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:05,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:39:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:05,847 INFO L225 Difference]: With dead ends: 84 [2019-01-20 10:39:05,847 INFO L226 Difference]: Without dead ends: 78 [2019-01-20 10:39:05,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:39:05,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-20 10:39:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-01-20 10:39:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-20 10:39:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-01-20 10:39:05,862 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-01-20 10:39:05,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:05,863 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-01-20 10:39:05,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-01-20 10:39:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:05,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:05,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:05,864 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:05,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:05,864 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-20 10:39:05,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:05,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:05,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:05,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:05,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:05,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:05,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:05,982 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:05,983 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-20 10:39:05,984 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:05,984 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:06,292 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:06,292 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:06,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:06,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:06,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:06,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:06,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:06,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:06,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:06,333 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 21 treesize of output 27 [2019-01-20 10:39:06,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,339 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 23 treesize of output 37 [2019-01-20 10:39:06,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:06,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:39:06,361 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,390 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,419 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:06,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:06,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:06,516 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,526 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,536 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:06,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:06,558 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-20 10:39:06,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:06,733 INFO L303 Elim1Store]: Index analysis took 149 ms [2019-01-20 10:39:06,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-20 10:39:06,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:39:07,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:07,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-01-20 10:39:08,333 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-20 10:39:08,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-20 10:39:08,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-20 10:39:08,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,627 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:08,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-20 10:39:08,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:08,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-20 10:39:08,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-01-20 10:39:08,996 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-01-20 10:39:09,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,011 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:09,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 86 [2019-01-20 10:39:09,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,108 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 55 treesize of output 53 [2019-01-20 10:39:09,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,185 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:09,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-01-20 10:39:09,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,289 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:09,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-20 10:39:09,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-20 10:39:09,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-01-20 10:39:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:09,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:09,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:09,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:39:09,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:09,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:09,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:09,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:09,521 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-01-20 10:39:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:10,412 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-01-20 10:39:10,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:39:10,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:10,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:10,415 INFO L225 Difference]: With dead ends: 109 [2019-01-20 10:39:10,415 INFO L226 Difference]: Without dead ends: 107 [2019-01-20 10:39:10,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:39:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-20 10:39:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-01-20 10:39:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 10:39:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-01-20 10:39:10,433 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-01-20 10:39:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:10,434 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-01-20 10:39:10,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-01-20 10:39:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:10,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:10,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:10,435 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:10,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:10,435 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-20 10:39:10,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:10,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:10,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:10,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:10,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:10,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:10,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:10,527 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:10,527 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-20 10:39:10,528 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:10,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:10,793 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:10,794 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:10,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:10,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:10,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:10,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:10,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:10,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:10,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:10,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:10,835 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 21 treesize of output 27 [2019-01-20 10:39:10,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,847 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 23 treesize of output 37 [2019-01-20 10:39:10,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,861 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:10,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:39:10,873 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,894 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:10,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:11,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:11,008 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:11,018 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:11,027 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:11,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:11,049 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:39:11,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:39:11,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:11,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. [2019-01-20 10:39:11,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:11,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:39:11,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:11,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:11,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:11,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:11,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:11,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:11,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:11,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:11,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:11,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:11,290 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-01-20 10:39:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:11,656 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-01-20 10:39:11,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:11,656 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:39:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:11,658 INFO L225 Difference]: With dead ends: 77 [2019-01-20 10:39:11,658 INFO L226 Difference]: Without dead ends: 76 [2019-01-20 10:39:11,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-20 10:39:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-20 10:39:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-20 10:39:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-01-20 10:39:11,678 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-01-20 10:39:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:11,679 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-01-20 10:39:11,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-01-20 10:39:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:11,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:11,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:11,680 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:11,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-01-20 10:39:11,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:11,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:11,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:11,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:11,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:11,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:11,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:11,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:11,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:11,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:11,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:11,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:11,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:11,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:39:11,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:11,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:11,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:11,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:11,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,949 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:11,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:11,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:12,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:39:12,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:39:12,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:12,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:39:12,075 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,097 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,110 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,121 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,130 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:12,159 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:39:12,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:12,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:12,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:12,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,247 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:12,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-20 10:39:12,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:12,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-20 10:39:12,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-20 10:39:12,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:12,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-20 10:39:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:12,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:12,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:12,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:39:12,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:12,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:12,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:12,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:12,544 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-01-20 10:39:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:13,094 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-01-20 10:39:13,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:13,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:13,098 INFO L225 Difference]: With dead ends: 88 [2019-01-20 10:39:13,098 INFO L226 Difference]: Without dead ends: 83 [2019-01-20 10:39:13,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:39:13,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-20 10:39:13,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-01-20 10:39:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 10:39:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-20 10:39:13,122 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-20 10:39:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:13,123 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-20 10:39:13,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-20 10:39:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:13,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:13,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:13,124 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:13,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-20 10:39:13,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:13,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:13,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:13,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:13,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:13,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:13,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:13,181 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:13,181 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-20 10:39:13,182 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:13,183 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:13,403 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:13,403 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:13,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:13,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:13,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:13,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:13,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:13,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:13,422 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 18 treesize of output 21 [2019-01-20 10:39:13,431 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 21 treesize of output 23 [2019-01-20 10:39:13,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:39:13,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:39:13,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:39:13,491 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,530 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:39:13,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:39:13,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:39:13,607 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,616 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,625 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:13,644 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-20 10:39:13,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:39:13,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:13,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:39:13,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:39:13,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:13,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-20 10:39:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:13,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:13,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:13,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:13,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:13,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:13,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:13,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:13,778 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-01-20 10:39:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:14,032 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-01-20 10:39:14,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:14,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:39:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:14,034 INFO L225 Difference]: With dead ends: 81 [2019-01-20 10:39:14,034 INFO L226 Difference]: Without dead ends: 80 [2019-01-20 10:39:14,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-20 10:39:14,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-01-20 10:39:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 10:39:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-20 10:39:14,050 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-20 10:39:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:14,050 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-20 10:39:14,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-20 10:39:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:14,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:14,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:14,051 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:14,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:14,051 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-20 10:39:14,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:14,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:14,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:14,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:14,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:14,222 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-01-20 10:39:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:14,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:14,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:14,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:14,278 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-20 10:39:14,279 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:14,279 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:14,683 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:14,688 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:14,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:14,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:14,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:14,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:14,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:14,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:14,891 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-20 10:39:14,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:15,150 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-20 10:39:15,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:15,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:15,188 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,197 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:15,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:39:15,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:39:15,234 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:15,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:39:15,241 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,258 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,273 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,284 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,294 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:15,317 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-20 10:39:15,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:39:15,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:15,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:15,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:39:15,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:15,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:15,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,485 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:15,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-20 10:39:15,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:15,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:39:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:15,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:15,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:15,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:39:15,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:15,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:15,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:15,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:15,598 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-01-20 10:39:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:16,074 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-01-20 10:39:16,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:39:16,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:16,076 INFO L225 Difference]: With dead ends: 113 [2019-01-20 10:39:16,076 INFO L226 Difference]: Without dead ends: 112 [2019-01-20 10:39:16,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-20 10:39:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-01-20 10:39:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-20 10:39:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-01-20 10:39:16,096 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-01-20 10:39:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:16,096 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-01-20 10:39:16,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-01-20 10:39:16,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:16,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:16,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:16,097 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:16,097 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-01-20 10:39:16,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:16,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:16,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:16,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:16,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:16,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:16,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:16,258 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:16,259 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-01-20 10:39:16,260 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:16,260 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:16,603 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:16,603 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:16,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:16,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:16,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:16,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:16,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:16,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:16,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:16,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:16,660 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 21 treesize of output 27 [2019-01-20 10:39:16,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,671 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 23 treesize of output 37 [2019-01-20 10:39:16,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,681 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:16,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:39:16,714 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,743 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,771 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:16,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:16,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:16,881 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,891 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,900 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:16,920 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:39:16,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:17,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-20 10:39:17,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-20 10:39:17,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-01-20 10:39:17,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,279 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 55 treesize of output 69 [2019-01-20 10:39:17,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,360 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:17,360 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 43 treesize of output 51 [2019-01-20 10:39:17,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-20 10:39:17,433 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-20 10:39:17,510 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:96 [2019-01-20 10:39:19,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,621 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 37 treesize of output 79 [2019-01-20 10:39:19,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,711 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:19,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-01-20 10:39:19,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,783 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 55 treesize of output 51 [2019-01-20 10:39:19,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-20 10:39:19,827 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-01-20 10:39:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:19,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:19,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:19,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-20 10:39:19,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:19,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:19,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:19,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=78, Unknown=1, NotChecked=0, Total=132 [2019-01-20 10:39:19,907 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-01-20 10:39:20,306 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-01-20 10:39:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:20,771 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-01-20 10:39:20,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:39:20,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:20,773 INFO L225 Difference]: With dead ends: 137 [2019-01-20 10:39:20,773 INFO L226 Difference]: Without dead ends: 136 [2019-01-20 10:39:20,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=90, Invalid=149, Unknown=1, NotChecked=0, Total=240 [2019-01-20 10:39:20,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-20 10:39:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-20 10:39:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-20 10:39:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-01-20 10:39:20,803 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-01-20 10:39:20,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:20,804 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-01-20 10:39:20,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-01-20 10:39:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:20,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:20,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:20,805 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:20,805 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-20 10:39:20,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:20,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:20,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:20,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:20,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:20,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:20,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:20,897 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:20,898 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-20 10:39:20,899 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:20,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:21,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:21,478 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:21,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:21,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:21,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:21,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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:21,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:21,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:21,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:21,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:21,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:21,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,662 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:21,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:21,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,742 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:21,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:39:21,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:39:21,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:21,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:39:21,791 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,814 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,827 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,838 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,848 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:21,878 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-20 10:39:21,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:39:21,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:21,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:22,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,016 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:22,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:39:22,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:22,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:22,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-20 10:39:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:22,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:22,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:22,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:22,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:22,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:22,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:22,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:22,161 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-01-20 10:39:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:22,728 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-01-20 10:39:22,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:22,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:39:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:22,729 INFO L225 Difference]: With dead ends: 120 [2019-01-20 10:39:22,729 INFO L226 Difference]: Without dead ends: 119 [2019-01-20 10:39:22,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-20 10:39:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-01-20 10:39:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-20 10:39:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-01-20 10:39:22,772 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-01-20 10:39:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:22,772 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-01-20 10:39:22,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-01-20 10:39:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:22,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:22,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:22,773 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:22,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:22,774 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-20 10:39:22,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:22,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:22,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:22,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:22,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:22,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:22,859 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:22,859 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-20 10:39:22,859 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:22,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:24,314 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:24,314 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:39:24,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:24,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:24,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:24,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:24,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:24,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:24,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:24,332 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 18 treesize of output 21 [2019-01-20 10:39:24,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:39:24,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:39:24,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:39:24,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,392 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 27 treesize of output 62 [2019-01-20 10:39:24,393 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,417 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,443 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:39:24,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:39:24,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:39:24,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:39:24,578 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,592 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,607 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,623 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:24,652 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-20 10:39:24,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:39:24,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:24,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-20 10:39:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:24,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:24,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:39:24,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:39:24,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:24,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:39:24,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:39:24,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:39:24,850 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-01-20 10:39:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:25,007 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-01-20 10:39:25,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:39:25,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:39:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:25,009 INFO L225 Difference]: With dead ends: 105 [2019-01-20 10:39:25,009 INFO L226 Difference]: Without dead ends: 104 [2019-01-20 10:39:25,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:39:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-20 10:39:25,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-20 10:39:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-20 10:39:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-01-20 10:39:25,056 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-01-20 10:39:25,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:25,056 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-01-20 10:39:25,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:39:25,056 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-01-20 10:39:25,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:25,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:25,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:25,057 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:25,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:25,058 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-01-20 10:39:25,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:25,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:25,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:25,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:25,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:25,626 WARN L181 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-20 10:39:26,090 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-01-20 10:39:26,285 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:39:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:26,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:26,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:26,464 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:26,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:26,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:26,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:26,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:39:26,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:39:26,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:39:26,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:26,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:26,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:26,539 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 21 treesize of output 27 [2019-01-20 10:39:26,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:39:26,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,555 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:26,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:39:26,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,581 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:26,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:26,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:26,700 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,710 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,719 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:26,739 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-20 10:39:26,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:26,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-20 10:39:26,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-20 10:39:26,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:231 [2019-01-20 10:39:27,092 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-01-20 10:39:27,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,102 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 55 treesize of output 69 [2019-01-20 10:39:27,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:27,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,198 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:27,199 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 43 treesize of output 51 [2019-01-20 10:39:27,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:27,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-20 10:39:27,292 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:27,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-20 10:39:27,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:27,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-20 10:39:27,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:197, output treesize:121 [2019-01-20 10:39:27,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,530 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:27,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-01-20 10:39:27,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:27,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,636 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:27,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:39:27,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:27,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-01-20 10:39:27,755 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:27,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,869 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:27,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-20 10:39:27,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:27,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-20 10:39:27,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-01-20 10:39:28,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:28,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:28,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:28,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:39:28,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:28,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:28,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:28,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:28,120 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-01-20 10:39:28,500 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-01-20 10:39:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:28,800 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-01-20 10:39:28,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:28,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:28,803 INFO L225 Difference]: With dead ends: 131 [2019-01-20 10:39:28,803 INFO L226 Difference]: Without dead ends: 130 [2019-01-20 10:39:28,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:39:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-20 10:39:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-01-20 10:39:28,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:39:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-01-20 10:39:28,830 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-01-20 10:39:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:28,830 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-01-20 10:39:28,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-01-20 10:39:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:28,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:28,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:28,831 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:28,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:28,831 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-20 10:39:28,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:28,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:28,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:28,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:28,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:28,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:28,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:28,943 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:28,943 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-20 10:39:28,945 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:28,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:29,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:29,437 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:29,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:29,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:29,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:29,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:29,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:29,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:29,459 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 18 treesize of output 21 [2019-01-20 10:39:29,463 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 21 treesize of output 23 [2019-01-20 10:39:29,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:39:29,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:39:29,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,502 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 27 treesize of output 62 [2019-01-20 10:39:29,503 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,538 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,561 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,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 43 treesize of output 39 [2019-01-20 10:39:29,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,607 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 36 treesize of output 49 [2019-01-20 10:39:29,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:39:29,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:39:29,689 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,703 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,718 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,734 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:29,763 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:39:29,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:39:29,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:29,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:39:29,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,883 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:29,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 76 [2019-01-20 10:39:29,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:29,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-20 10:39:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:29,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:29,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:29,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:29,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:29,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:29,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:29,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:29,974 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-01-20 10:39:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:30,461 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-01-20 10:39:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:30,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:39:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:30,462 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:39:30,463 INFO L226 Difference]: Without dead ends: 68 [2019-01-20 10:39:30,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:39:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-20 10:39:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-01-20 10:39:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-20 10:39:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-01-20 10:39:30,486 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-01-20 10:39:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:30,486 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-01-20 10:39:30,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-01-20 10:39:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:30,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:30,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:30,487 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:30,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:30,487 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-20 10:39:30,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:30,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:30,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:30,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:30,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:30,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:30,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:30,658 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:30,658 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-20 10:39:30,660 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:30,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:30,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:30,891 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:30,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:30,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:30,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:30,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:30,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:30,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:30,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:30,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:30,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:31,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:31,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:31,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:31,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:31,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:31,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:39:31,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:39:31,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:31,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:39:31,096 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:31,113 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:31,127 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:31,137 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:31,146 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:31,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:31,168 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-20 10:39:31,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:39:31,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:31,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:31,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:31,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,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 31 treesize of output 65 [2019-01-20 10:39:31,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:31,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:31,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-20 10:39:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:31,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:31,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:31,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:39:31,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:31,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:31,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:31,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:31,303 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-01-20 10:39:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:31,570 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-01-20 10:39:31,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:31,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:39:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:31,572 INFO L225 Difference]: With dead ends: 73 [2019-01-20 10:39:31,572 INFO L226 Difference]: Without dead ends: 72 [2019-01-20 10:39:31,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:39:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-20 10:39:31,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-01-20 10:39:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 10:39:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-01-20 10:39:31,596 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-01-20 10:39:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:31,597 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-01-20 10:39:31,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-01-20 10:39:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:31,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:31,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:31,597 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:31,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:31,598 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-20 10:39:31,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:31,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:31,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:31,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:31,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:31,697 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:31,697 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-20 10:39:31,700 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:31,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:31,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:31,924 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:31,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:31,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:31,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:31,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:31,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:31,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:31,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:31,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, 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 21 [2019-01-20 10:39: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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:39:31,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,970 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 23 treesize of output 37 [2019-01-20 10:39:31,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:31,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:31,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:39:31,995 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,017 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:32,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:32,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:32,145 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,155 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,164 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:32,186 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:39:32,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:39:32,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:32,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:32,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:32,268 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:32,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-20 10:39:32,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:32,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:32,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-20 10:39:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:32,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:32,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:32,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-20 10:39:32,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:32,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:39:32,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:39:32,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:39:32,359 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-01-20 10:39:32,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:32,596 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-20 10:39:32,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:32,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-20 10:39:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:32,598 INFO L225 Difference]: With dead ends: 66 [2019-01-20 10:39:32,598 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 10:39:32,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 10:39:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-01-20 10:39:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-20 10:39:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-01-20 10:39:32,634 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-01-20 10:39:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:32,635 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-01-20 10:39:32,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:39:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-01-20 10:39:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:32,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:32,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:32,636 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:32,636 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-20 10:39:32,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:32,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:32,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:32,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:32,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:32,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:39:32,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:39:32,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:32,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:39:32,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:39:32,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:39:32,743 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-01-20 10:39:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:32,809 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-01-20 10:39:32,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:39:32,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:39:32,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:32,810 INFO L225 Difference]: With dead ends: 54 [2019-01-20 10:39:32,810 INFO L226 Difference]: Without dead ends: 51 [2019-01-20 10:39:32,810 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 [2019-01-20 10:39:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-20 10:39:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-01-20 10:39:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 10:39:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-01-20 10:39:32,841 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-01-20 10:39:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:32,842 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-01-20 10:39:32,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:39:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-01-20 10:39:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:32,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:32,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:32,843 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:32,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:32,843 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-01-20 10:39:32,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:32,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:32,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:32,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:32,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:33,056 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-20 10:39:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:33,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:33,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:33,227 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:33,227 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-20 10:39:33,228 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:33,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:33,440 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:33,440 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:33,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:33,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:33,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:33,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:33,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:33,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:33,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:33,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:39:33,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:39:33,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:39:33,527 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:33,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:39:33,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:39:33,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:39:33,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:39:33,579 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,595 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,605 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,615 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,624 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:33,643 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-20 10:39:33,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:39:33,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:39:33,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:33,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-01-20 10:39:33,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:39:33,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:33,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-20 10:39:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:33,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:33,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:33,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:39:33,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:33,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:33,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:33,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:33,824 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-01-20 10:39:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:34,081 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-01-20 10:39:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:34,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:39:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:34,083 INFO L225 Difference]: With dead ends: 83 [2019-01-20 10:39:34,083 INFO L226 Difference]: Without dead ends: 82 [2019-01-20 10:39:34,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-20 10:39:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-20 10:39:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-20 10:39:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-01-20 10:39:34,142 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-01-20 10:39:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:34,143 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-01-20 10:39:34,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-01-20 10:39:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:34,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:34,144 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:39:34,144 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:34,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:34,144 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-01-20 10:39:34,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:34,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:34,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:34,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:34,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:34,233 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:34,233 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-20 10:39:34,235 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:34,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:34,378 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:34,379 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:39:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:34,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:34,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:34,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:34,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:34,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:34,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:34,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 26 treesize of output 25 [2019-01-20 10:39:34,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:39:34,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:39:34,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,482 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:34,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:39:34,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:39:34,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:39:34,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:39:34,527 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,542 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,555 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,565 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,574 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:34,593 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-20 10:39:34,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:39:34,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:34,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:39:34,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:34,645 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 40 [2019-01-20 10:39:34,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:34,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-01-20 10:39:34,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:34,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:34,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:34,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:39:34,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:34,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:34,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:34,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:34,714 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-01-20 10:39:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:35,059 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-01-20 10:39:35,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:35,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:39:35,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:35,061 INFO L225 Difference]: With dead ends: 86 [2019-01-20 10:39:35,061 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:39:35,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:39:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-01-20 10:39:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-20 10:39:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-01-20 10:39:35,122 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-01-20 10:39:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:35,122 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-01-20 10:39:35,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-01-20 10:39:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:35,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:35,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:35,123 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:35,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:35,123 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-20 10:39:35,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:35,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:35,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:35,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:35,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:35,269 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:39:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:35,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:35,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:35,720 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:35,720 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-20 10:39:35,721 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:35,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:36,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:36,009 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:36,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:36,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:36,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:36,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:36,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:36,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:36,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:36,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:36,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:36,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,137 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:36,271 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-20 10:39:36,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:36,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:36,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:39:36,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:39:36,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:36,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:39:36,384 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,410 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,423 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,434 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,444 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:36,473 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:39:36,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:36,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:36,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:36,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:39:36,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:36,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-20 10:39:36,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:36,630 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:36,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-20 10:39:36,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:36,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-20 10:39:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:36,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:36,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:36,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:39:36,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:36,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:36,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:36,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:36,859 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-01-20 10:39:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:37,384 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-01-20 10:39:37,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:37,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:39:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:37,386 INFO L225 Difference]: With dead ends: 100 [2019-01-20 10:39:37,386 INFO L226 Difference]: Without dead ends: 99 [2019-01-20 10:39:37,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:39:37,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-20 10:39:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-01-20 10:39:37,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-20 10:39:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-01-20 10:39:37,474 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-01-20 10:39:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:37,474 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-01-20 10:39:37,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-01-20 10:39:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:37,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:37,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:37,475 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:37,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:37,475 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-20 10:39:37,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:37,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:37,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:37,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:37,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:37,618 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:39:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:37,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:37,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:37,686 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:37,686 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-20 10:39:37,687 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:37,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:37,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:37,981 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:37,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:37,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:37,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:37,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:37,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:37,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:37,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:37,997 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 43 treesize of output 39 [2019-01-20 10:39:38,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,025 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 36 treesize of output 49 [2019-01-20 10:39:38,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:39:38,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:39:38,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,200 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:38,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:39:38,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:39:38,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:39:38,271 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 27 treesize of output 62 [2019-01-20 10:39:38,272 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,307 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,326 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,339 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,352 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:38,399 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:39:38,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:39:38,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:38,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:38,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:39:38,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:38,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:38,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,534 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:38,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-20 10:39:38,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:38,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:39:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:38,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:38,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:38,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:39:38,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:38,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:38,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:38,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:38,631 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-01-20 10:39:39,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:39,096 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-01-20 10:39:39,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:39,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:39:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:39,098 INFO L225 Difference]: With dead ends: 104 [2019-01-20 10:39:39,098 INFO L226 Difference]: Without dead ends: 103 [2019-01-20 10:39:39,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:39:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-20 10:39:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-01-20 10:39:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-20 10:39:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-20 10:39:39,195 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-20 10:39:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:39,195 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-20 10:39:39,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-20 10:39:39,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:39,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:39,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:39,196 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:39,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:39,196 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-20 10:39:39,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:39,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:39,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:39,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:39,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:39,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:39,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:39,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:39,268 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-20 10:39:39,271 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:39,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:39,541 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:39,542 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:39,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:39,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:39,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:39,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:39,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:39,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:39,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:39,699 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-20 10:39:39,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:39,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:39,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:39,780 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,791 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:39,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:39:39,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:39:39,822 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:39,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:39:39,828 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,846 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,860 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,870 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,880 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:39,902 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-20 10:39:39,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,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 [2019-01-20 10:39:39,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:39,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:39,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:39,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:39,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:39:39,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:40,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:40,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:39:40,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,037 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:40,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-20 10:39:40,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:40,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:40,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:39:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:40,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:40,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:40,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:39:40,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:40,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:40,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:40,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:40,135 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-01-20 10:39:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:40,725 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-01-20 10:39:40,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:40,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:39:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:40,727 INFO L225 Difference]: With dead ends: 107 [2019-01-20 10:39:40,727 INFO L226 Difference]: Without dead ends: 106 [2019-01-20 10:39:40,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:39:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-20 10:39:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-01-20 10:39:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-20 10:39:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-20 10:39:40,834 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-20 10:39:40,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:40,834 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-20 10:39:40,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:40,834 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-20 10:39:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:40,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:40,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:40,835 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:40,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:40,835 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-01-20 10:39:40,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:40,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:40,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:40,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:40,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:40,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:40,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:40,956 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:40,956 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-20 10:39:40,958 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:40,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:41,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:41,199 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:41,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:41,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:41,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:41,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:41,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:41,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:41,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:41,220 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 18 treesize of output 21 [2019-01-20 10:39:41,227 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 21 treesize of output 23 [2019-01-20 10:39:41,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:39:41,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:39:41,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,269 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 27 treesize of output 62 [2019-01-20 10:39:41,270 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,297 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,323 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,353 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 43 treesize of output 39 [2019-01-20 10:39:41,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:39:41,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:39:41,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:39:41,452 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,464 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,478 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,493 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:41,539 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:39:41,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:39:41,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,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. [2019-01-20 10:39:41,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:39:41,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:39:41,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:41,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-20 10:39:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:41,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:41,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:41,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:41,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:41,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:41,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:41,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:41,695 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-01-20 10:39:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:42,063 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-01-20 10:39:42,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:42,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:39:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:42,065 INFO L225 Difference]: With dead ends: 100 [2019-01-20 10:39:42,065 INFO L226 Difference]: Without dead ends: 98 [2019-01-20 10:39:42,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-20 10:39:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-01-20 10:39:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-20 10:39:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-01-20 10:39:42,176 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-01-20 10:39:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:42,176 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-01-20 10:39:42,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-01-20 10:39:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:42,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:42,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:42,177 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:42,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:42,177 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-20 10:39:42,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:42,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:42,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:42,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:42,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:42,325 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-20 10:39:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:42,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:42,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:42,342 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:42,343 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-20 10:39:42,343 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:42,343 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:42,968 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:42,968 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:42,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:42,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:42,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:42,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:42,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:42,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:43,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:43,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:43,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:43,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,133 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:43,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:39:43,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:39:43,181 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:43,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:39:43,196 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,227 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,246 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,264 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,276 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:43,302 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:39:43,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:43,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-20 10:39:43,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-20 10:39:43,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-01-20 10:39:43,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,620 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 51 treesize of output 65 [2019-01-20 10:39:43,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,707 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:43,707 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 43 treesize of output 65 [2019-01-20 10:39:43,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,781 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:43,782 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 43 treesize of output 63 [2019-01-20 10:39:43,782 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-20 10:39:43,836 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:92 [2019-01-20 10:39:43,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 69 [2019-01-20 10:39:43,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,969 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:43,970 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 39 treesize of output 53 [2019-01-20 10:39:43,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:44,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:44,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:44,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:44,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:44,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:44,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:44,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:44,032 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 39 treesize of output 65 [2019-01-20 10:39:44,032 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:44,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-20 10:39:44,084 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-01-20 10:39:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:44,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:44,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:44,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:39:44,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:44,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:44,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:44,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:44,272 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-01-20 10:39:45,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:45,220 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-20 10:39:45,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:45,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:39:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:45,222 INFO L225 Difference]: With dead ends: 124 [2019-01-20 10:39:45,222 INFO L226 Difference]: Without dead ends: 123 [2019-01-20 10:39:45,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:39:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-20 10:39:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-01-20 10:39:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-20 10:39:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-01-20 10:39:45,330 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-01-20 10:39:45,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:45,331 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-01-20 10:39:45,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-01-20 10:39:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:45,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:45,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:45,331 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:45,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:45,332 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-20 10:39:45,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:45,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:45,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:45,471 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:39:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:45,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:45,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:45,512 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:45,513 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-20 10:39:45,513 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:45,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:46,192 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:46,192 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:46,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:46,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:46,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:46,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:46,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:46,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:46,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:46,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:46,241 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 21 treesize of output 27 [2019-01-20 10:39:46,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,252 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 23 treesize of output 37 [2019-01-20 10:39:46,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,261 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:46,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:39:46,277 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,305 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,331 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:46,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:46,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:46,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:46,493 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,510 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,527 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,543 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:46,575 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:39:46,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:39:46,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,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. [2019-01-20 10:39:46,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:46,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,672 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:46,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:39:46,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:46,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-20 10:39:46,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,736 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:46,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:39:46,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:46,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:39:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:46,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:46,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:46,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:39:46,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:46,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:39:46,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:39:46,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:46,848 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-01-20 10:39:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:47,874 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-01-20 10:39:47,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:47,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:39:47,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:47,876 INFO L225 Difference]: With dead ends: 114 [2019-01-20 10:39:47,876 INFO L226 Difference]: Without dead ends: 113 [2019-01-20 10:39:47,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:47,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-20 10:39:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-01-20 10:39:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-20 10:39:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-01-20 10:39:47,997 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-01-20 10:39:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:47,997 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-01-20 10:39:47,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:39:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-01-20 10:39:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:47,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:47,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:47,998 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:47,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:47,998 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-01-20 10:39:47,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:47,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:47,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:47,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:47,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:48,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:48,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:48,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:48,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:48,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:48,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:48,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:48,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:48,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:39:48,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:48,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:48,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:48,157 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 21 treesize of output 27 [2019-01-20 10:39:48,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,167 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 23 treesize of output 37 [2019-01-20 10:39:48,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,178 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:48,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:39:48,191 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,242 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:48,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:48,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,435 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:48,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:48,489 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,506 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,522 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,538 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:48,568 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-20 10:39:48,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:39:48,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:48,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:48,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:39:48,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:48,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-20 10:39:48,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,706 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:48,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:39:48,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:48,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-20 10:39:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:48,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:48,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:48,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:39:48,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:48,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:48,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:48,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:48,801 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-01-20 10:39:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:49,376 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-01-20 10:39:49,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:39:49,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:39:49,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:49,378 INFO L225 Difference]: With dead ends: 164 [2019-01-20 10:39:49,378 INFO L226 Difference]: Without dead ends: 163 [2019-01-20 10:39:49,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-20 10:39:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-01-20 10:39:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-20 10:39:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-01-20 10:39:49,613 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-01-20 10:39:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:49,613 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-01-20 10:39:49,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-01-20 10:39:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:49,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:49,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:49,614 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:49,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:49,614 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-01-20 10:39:49,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:49,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:49,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:49,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:49,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:49,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:49,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:49,709 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:49,709 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-20 10:39:49,710 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:49,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:50,190 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:50,190 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:50,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:50,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:50,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:50,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:50,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:50,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:50,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:50,208 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 43 treesize of output 39 [2019-01-20 10:39:50,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,232 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 36 treesize of output 49 [2019-01-20 10:39:50,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:39:50,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:39:50,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,348 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,361 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:50,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:39:50,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:39:50,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:39:50,409 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 27 treesize of output 62 [2019-01-20 10:39:50,410 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,432 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,443 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,454 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,464 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:50,495 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:39:50,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:39:50,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:50,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:39:50,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:39:50,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:39:50,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:50,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-20 10:39:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:50,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:50,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:50,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:50,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:50,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:50,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:50,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:50,790 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-01-20 10:39:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:51,276 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-01-20 10:39:51,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:51,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:39:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:51,279 INFO L225 Difference]: With dead ends: 160 [2019-01-20 10:39:51,279 INFO L226 Difference]: Without dead ends: 159 [2019-01-20 10:39:51,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-20 10:39:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-01-20 10:39:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-20 10:39:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-01-20 10:39:51,718 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-01-20 10:39:51,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:51,718 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-01-20 10:39:51,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:51,719 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-01-20 10:39:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:51,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:51,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:51,720 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:51,720 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-01-20 10:39:51,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:51,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:51,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:51,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:51,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:51,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:51,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:51,813 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:51,813 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-20 10:39:51,814 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:51,814 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:52,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:52,144 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:52,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:52,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:52,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:52,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:52,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:52,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:52,198 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 18 treesize of output 21 [2019-01-20 10:39:52,205 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 21 treesize of output 23 [2019-01-20 10:39:52,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:39:52,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:39:52,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, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:39:52,239 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,256 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,280 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:39:52,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:39:52,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:39:52,353 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,362 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,370 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:52,390 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-20 10:39:52,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:39:52,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:52,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:39:52,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:52,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:52,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-20 10:39:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:52,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:52,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:52,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:39:52,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:52,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:52,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:52,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:52,516 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-01-20 10:39:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:53,024 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-01-20 10:39:53,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:53,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:39:53,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:53,027 INFO L225 Difference]: With dead ends: 175 [2019-01-20 10:39:53,028 INFO L226 Difference]: Without dead ends: 174 [2019-01-20 10:39:53,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:39:53,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-20 10:39:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-01-20 10:39:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-20 10:39:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-20 10:39:53,269 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-20 10:39:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:53,269 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-20 10:39:53,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-20 10:39:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:53,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:53,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:53,270 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:53,270 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-20 10:39:53,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:53,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:53,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:53,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:53,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:39:53,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:39:53,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 10:39:53,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:53,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:39:53,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:39:53,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:39:53,403 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-01-20 10:39:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:53,773 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-01-20 10:39:53,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:39:53,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-20 10:39:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:53,774 INFO L225 Difference]: With dead ends: 185 [2019-01-20 10:39:53,775 INFO L226 Difference]: Without dead ends: 184 [2019-01-20 10:39:53,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:39:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-20 10:39:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-01-20 10:39:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-20 10:39:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-20 10:39:54,016 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-20 10:39:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:54,017 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-20 10:39:54,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:39:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-20 10:39:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:54,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:54,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:54,018 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:54,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:54,018 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-01-20 10:39:54,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:54,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:54,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:54,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:54,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:54,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:54,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:54,085 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:54,085 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-20 10:39:54,086 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:54,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:54,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:54,393 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:54,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:54,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:54,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:54,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:54,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:54,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:54,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:54,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:39:54,569 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 10:39:54,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:39:54,990 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-20 10:39:55,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,115 INFO L303 Elim1Store]: Index analysis took 123 ms [2019-01-20 10:39:55,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:39:55,116 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:55,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:39:55,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:39:55,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:39:55,807 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-01-20 10:39:55,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:39:55,809 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,879 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,891 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,900 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,910 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:55,928 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-20 10:39:55,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:39:55,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:55,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:39:55,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,987 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:55,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-01-20 10:39:55,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:56,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:56,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-20 10:39:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:56,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:56,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:56,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:56,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:56,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:56,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:56,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:56,054 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-01-20 10:39:56,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:56,538 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-01-20 10:39:56,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:56,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:39:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:56,541 INFO L225 Difference]: With dead ends: 142 [2019-01-20 10:39:56,542 INFO L226 Difference]: Without dead ends: 141 [2019-01-20 10:39:56,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-20 10:39:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-01-20 10:39:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-20 10:39:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-01-20 10:39:56,778 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-01-20 10:39:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:56,779 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-01-20 10:39:56,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-01-20 10:39:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:56,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:56,779 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:39:56,779 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:56,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:56,780 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-01-20 10:39:56,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:56,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:56,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:56,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:56,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:56,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:56,856 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:39:56,856 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-20 10:39:56,857 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:56,857 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:57,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:57,388 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:57,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:57,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:57,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:57,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:57,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:57,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:57,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:57,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:57,412 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 21 treesize of output 23 [2019-01-20 10:39:57,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:39:57,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:39:57,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:39:57,456 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,487 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,542 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 43 treesize of output 39 [2019-01-20 10:39:57,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,559 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 36 treesize of output 49 [2019-01-20 10:39:57,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:39:57,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:39:57,641 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,655 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,669 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,684 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:57,711 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-20 10:39:57,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:39:57,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:39:57,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:57,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-20 10:39:57,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:39:57,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:57,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-20 10:39:57,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,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 79 [2019-01-20 10:39:57,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:57,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:39:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:57,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:58,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:58,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-20 10:39:58,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:58,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:39:58,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:39:58,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:39:58,008 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-01-20 10:39:58,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:58,715 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-01-20 10:39:58,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:39:58,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:39:58,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:58,717 INFO L225 Difference]: With dead ends: 219 [2019-01-20 10:39:58,718 INFO L226 Difference]: Without dead ends: 216 [2019-01-20 10:39:58,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-20 10:39:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-01-20 10:39:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-20 10:39:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-01-20 10:39:59,023 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-01-20 10:39:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:59,023 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-01-20 10:39:59,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:39:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-01-20 10:39:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:39:59,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:59,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:39:59,024 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:59,024 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-01-20 10:39:59,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:59,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:59,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:59,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:59,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:59,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:59,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:59,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:59,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:59,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:59,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:59,115 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:39:59,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:39:59,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:39:59,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:59,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:59,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:39:59,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:39:59,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:39:59,199 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:59,209 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:59,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:59,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:39:59,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:39:59,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:39:59,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:39:59,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:39:59,249 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:59,267 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:59,281 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:59,293 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:59,303 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:59,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:59,324 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:39:59,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-20 10:39:59,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:39:59,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:59,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-01-20 10:39:59,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 80 [2019-01-20 10:39:59,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:39:59,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,629 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 48 treesize of output 74 [2019-01-20 10:39:59,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:59,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-20 10:39:59,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-01-20 10:39:59,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,763 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:59,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 88 [2019-01-20 10:39:59,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-01-20 10:39:59,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,963 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:59,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:59,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 37 treesize of output 65 [2019-01-20 10:39:59,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:00,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:00,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:00,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:00,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:00,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:00,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:00,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:00,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:00,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:00,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:00,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:00,080 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 37 treesize of output 79 [2019-01-20 10:40:00,081 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:00,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-20 10:40:00,172 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-01-20 10:40:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:00,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:00,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:00,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:40:00,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:00,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:40:00,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:40:00,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:40:00,342 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-01-20 10:40:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:01,523 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-01-20 10:40:01,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:40:01,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:40:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:01,526 INFO L225 Difference]: With dead ends: 218 [2019-01-20 10:40:01,526 INFO L226 Difference]: Without dead ends: 215 [2019-01-20 10:40:01,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:40:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-20 10:40:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-01-20 10:40:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-20 10:40:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-01-20 10:40:01,856 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-01-20 10:40:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:01,856 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-01-20 10:40:01,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:40:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-01-20 10:40:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:40:01,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:01,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:40:01,857 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:01,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:01,857 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-01-20 10:40:01,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:01,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:01,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:40:01,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:01,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:01,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:01,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:01,911 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:40:01,912 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-20 10:40:01,912 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:01,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:02,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:02,116 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:40:02,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:02,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:02,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:02,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:02,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:02,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:02,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:02,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:40:02,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,165 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 36 treesize of output 49 [2019-01-20 10:40:02,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:40:02,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:40:02,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:02,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:02,310 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:02,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:02,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:40:02,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:40:02,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:40:02,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:40:02,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:40:02,358 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:02,599 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:02,612 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:02,621 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:02,631 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:02,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:02,661 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-20 10:40:02,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:40:02,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:02,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:02,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:40:02,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-01-20 10:40:02,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:02,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:02,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-20 10:40:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:02,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:02,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:02,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:40:02,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:02,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:40:02,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:40:02,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:40:02,818 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-01-20 10:40:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:03,617 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-01-20 10:40:03,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:40:03,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:40:03,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:03,620 INFO L225 Difference]: With dead ends: 274 [2019-01-20 10:40:03,620 INFO L226 Difference]: Without dead ends: 269 [2019-01-20 10:40:03,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:40:03,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-20 10:40:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-01-20 10:40:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-20 10:40:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-01-20 10:40:04,116 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-01-20 10:40:04,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:04,116 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-01-20 10:40:04,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:40:04,116 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-01-20 10:40:04,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:40:04,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:04,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:40:04,117 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:04,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:04,118 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-01-20 10:40:04,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:04,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:04,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:04,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:04,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:04,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:04,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:04,261 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:40:04,261 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-20 10:40:04,262 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:04,262 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:05,212 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:05,212 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:40:05,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:05,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:05,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:05,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:05,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:05,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:05,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:05,278 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 18 treesize of output 21 [2019-01-20 10:40:05,319 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 21 treesize of output 23 [2019-01-20 10:40:05,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:40:05,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:40:05,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,523 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 27 treesize of output 62 [2019-01-20 10:40:05,524 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,566 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,622 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 43 treesize of output 39 [2019-01-20 10:40:05,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,642 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 36 treesize of output 49 [2019-01-20 10:40:05,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:40:05,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:40:05,726 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,740 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,754 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,770 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:05,797 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:40:05,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:40:05,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:05,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:40:05,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:40:05,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:40:05,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:40:05,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-20 10:40:06,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,056 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:06,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2019-01-20 10:40:06,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:06,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:06,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-20 10:40:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:06,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:06,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:06,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-20 10:40:06,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:06,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:40:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:40:06,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:40:06,129 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-01-20 10:40:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:07,657 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-01-20 10:40:07,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:40:07,658 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:40:07,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:07,663 INFO L225 Difference]: With dead ends: 480 [2019-01-20 10:40:07,663 INFO L226 Difference]: Without dead ends: 477 [2019-01-20 10:40:07,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:40:07,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-20 10:40:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-01-20 10:40:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-20 10:40:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-01-20 10:40:08,573 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-01-20 10:40:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:08,573 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-01-20 10:40:08,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:40:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-01-20 10:40:08,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:40:08,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:08,575 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:40:08,575 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:08,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:08,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-01-20 10:40:08,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:08,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:08,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:08,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:08,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:08,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:08,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:08,628 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:40:08,629 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-01-20 10:40:08,629 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:08,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:08,781 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:08,781 INFO L272 AbstractInterpreter]: Visited 6 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:40:08,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:08,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:08,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:08,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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:08,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:08,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:08,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:08,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21 [2019-01-20 10:40:08,807 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 21 treesize of output 23 [2019-01-20 10:40:08,835 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 23 treesize of output 25 [2019-01-20 10:40:08,852 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-20 10:40:08,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-20 10:40:08,878 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,894 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,919 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:08,945 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-20 10:40:08,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,955 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 [2019-01-20 10:40:08,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-20 10:40:08,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-01-20 10:40:08,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-20 10:40:08,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:08,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:08,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:40:08,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-01-20 10:40:08,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:40:08,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:40:08,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:40:08,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:40:08,995 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-01-20 10:40:10,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:10,903 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-01-20 10:40:10,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:40:10,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-20 10:40:10,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:10,909 INFO L225 Difference]: With dead ends: 804 [2019-01-20 10:40:10,910 INFO L226 Difference]: Without dead ends: 800 [2019-01-20 10:40:10,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:40:10,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-01-20 10:40:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-01-20 10:40:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-01-20 10:40:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-01-20 10:40:12,977 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-01-20 10:40:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:12,977 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-01-20 10:40:12,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:40:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-01-20 10:40:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:40:12,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:12,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:40:12,980 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-20 10:40:12,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:12,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:12,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:12,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:12,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:13,168 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-20 10:40:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:40:13,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:13,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:13,339 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:40:13,339 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-20 10:40:13,341 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:13,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:13,692 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:13,692 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:40:13,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:13,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:13,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:13,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:13,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:13,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:13,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:13,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:40:13,735 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 21 treesize of output 27 [2019-01-20 10:40:13,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,744 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 23 treesize of output 37 [2019-01-20 10:40:13,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,760 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:40:13,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:40:13,787 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:13,858 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:13,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:13,904 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:13,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:13,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:40:14,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:40:14,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,059 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:40:14,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:40:14,142 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,156 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,171 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,188 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,216 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-20 10:40:14,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:40:14,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:14,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-20 10:40:14,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:40:14,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:14,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-20 10:40:14,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,382 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:14,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-20 10:40:14,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:14,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-20 10:40:14,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,489 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:14,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:40:14,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:14,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-20 10:40:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:14,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:14,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:14,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:14,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:40:14,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:14,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:40:14,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:40:14,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:40:14,631 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-01-20 10:40:17,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:17,256 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-01-20 10:40:17,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:40:17,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:40:17,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:17,263 INFO L225 Difference]: With dead ends: 821 [2019-01-20 10:40:17,263 INFO L226 Difference]: Without dead ends: 820 [2019-01-20 10:40:17,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:40:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-01-20 10:40:19,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-01-20 10:40:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-01-20 10:40:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-01-20 10:40:19,233 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-01-20 10:40:19,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:19,234 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-01-20 10:40:19,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:40:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-01-20 10:40:19,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:40:19,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:19,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:40:19,236 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:19,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:19,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-20 10:40:19,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:19,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:19,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:19,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:19,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:19,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:19,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:19,288 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:40:19,288 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-20 10:40:19,289 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:19,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:19,504 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:19,504 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:40:19,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:19,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:19,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:19,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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:19,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:19,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:19,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:19,526 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 17 treesize of output 20 [2019-01-20 10:40:19,534 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 20 treesize of output 22 [2019-01-20 10:40:19,544 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 22 treesize of output 24 [2019-01-20 10:40:19,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-20 10:40:19,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,600 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:40:19,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:40:19,630 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 23 treesize of output 25 [2019-01-20 10:40:19,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-20 10:40:19,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:40:19,648 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,662 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,671 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,681 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,690 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:19,705 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-01-20 10:40:19,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,752 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 [2019-01-20 10:40:19,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-20 10:40:19,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,771 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 [2019-01-20 10:40:19,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:19,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-20 10:40:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:19,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:19,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:19,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:40:19,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:19,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:40:19,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:40:19,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:40:19,868 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-01-20 10:40:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:21,913 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-01-20 10:40:21,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:40:21,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:40:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:21,919 INFO L225 Difference]: With dead ends: 805 [2019-01-20 10:40:21,919 INFO L226 Difference]: Without dead ends: 804 [2019-01-20 10:40:21,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:40:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-01-20 10:40:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-01-20 10:40:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-01-20 10:40:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-01-20 10:40:23,995 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-01-20 10:40:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:23,995 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-01-20 10:40:23,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:40:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-01-20 10:40:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:40:23,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:23,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:40:23,998 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:23,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-01-20 10:40:23,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:23,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:23,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:23,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:23,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:40:24,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:24,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:24,163 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:40:24,163 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-20 10:40:24,164 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:24,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:24,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:24,481 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:40:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:24,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:24,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:24,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:24,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:24,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:24,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:24,503 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 18 treesize of output 21 [2019-01-20 10:40:24,507 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 21 treesize of output 23 [2019-01-20 10:40:24,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:40:24,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:40:24,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,550 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 27 treesize of output 62 [2019-01-20 10:40:24,551 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:24,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:24,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:24,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:24,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:24,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:40:24,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,651 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 36 treesize of output 49 [2019-01-20 10:40:24,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:40:24,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:40:24,737 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:24,752 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:24,767 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:24,783 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:24,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:24,812 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:40:24,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:40:24,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:24,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:24,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:40:24,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:40:24,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:24,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:24,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:40:24,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,953 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:24,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:24,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-20 10:40:24,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:24,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:24,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:40:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:25,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:25,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:25,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:40:25,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:25,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:40:25,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:40:25,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:40:25,072 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-01-20 10:40:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:27,944 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-01-20 10:40:27,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:40:27,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:40:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:27,955 INFO L225 Difference]: With dead ends: 1004 [2019-01-20 10:40:27,955 INFO L226 Difference]: Without dead ends: 1003 [2019-01-20 10:40:27,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:40:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-01-20 10:40:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-01-20 10:40:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-01-20 10:40:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-01-20 10:40:30,176 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-01-20 10:40:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:30,176 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-01-20 10:40:30,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:40:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-01-20 10:40:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:40:30,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:30,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:40:30,179 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-01-20 10:40:30,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:30,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:30,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:30,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:30,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:30,272 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:40:30,272 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-20 10:40:30,273 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:30,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:30,490 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:30,491 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:40:30,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:30,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:30,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:30,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:30,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:30,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:30,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:30,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:40:30,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:30,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:30,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:40:30,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:30,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:30,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:30,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:30,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:40:30,570 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:30,584 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:30,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:30,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:40:30,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:40:30,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:40:30,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:40:30,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:40:30,632 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:30,649 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:30,661 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:30,671 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:30,681 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:30,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:30,701 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-20 10:40:30,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:30,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-20 10:40:30,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:30,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:30,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-01-20 10:40:30,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:30,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:30,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:30,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:30,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:30,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:30,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:40:30,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:40:30,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:40:30,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-01-20 10:40:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:30,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:30,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:30,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-20 10:40:30,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:30,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:40:30,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:40:30,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:40:30,916 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-01-20 10:40:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:34,216 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-01-20 10:40:34,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:40:34,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-20 10:40:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:34,227 INFO L225 Difference]: With dead ends: 1213 [2019-01-20 10:40:34,227 INFO L226 Difference]: Without dead ends: 1212 [2019-01-20 10:40:34,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:40:34,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-01-20 10:40:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-01-20 10:40:37,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-01-20 10:40:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-01-20 10:40:37,153 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-01-20 10:40:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:37,153 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-01-20 10:40:37,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:40:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-01-20 10:40:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:40:37,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:37,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:40:37,156 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:37,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:37,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-01-20 10:40:37,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:37,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:37,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:37,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:37,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:37,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:37,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:37,343 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:40:37,343 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-20 10:40:37,344 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:37,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:37,691 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:37,691 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:40:37,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:37,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:37,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:37,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:37,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:37,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:37,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:37,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:40:37,746 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 21 treesize of output 27 [2019-01-20 10:40:37,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,754 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 23 treesize of output 37 [2019-01-20 10:40:37,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,763 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:40:37,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:40:37,775 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,801 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,829 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:40:37,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:40:37,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,934 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:40:37,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:40:37,983 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,999 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:38,014 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:38,030 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:38,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:38,059 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:40:38,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:40:38,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:38,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:38,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:40:38,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,148 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:38,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-20 10:40:38,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:38,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:38,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-01-20 10:40:38,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-20 10:40:38,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:38,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:38,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-01-20 10:40:38,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:38,275 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:38,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-20 10:40:38,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:38,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:38,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:40:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:38,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:38,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:38,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:40:38,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:38,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:40:38,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:40:38,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:40:38,399 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-01-20 10:40:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:42,781 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-01-20 10:40:42,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:40:42,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:40:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:42,798 INFO L225 Difference]: With dead ends: 1577 [2019-01-20 10:40:42,798 INFO L226 Difference]: Without dead ends: 1575 [2019-01-20 10:40:42,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:40:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-01-20 10:40:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-01-20 10:40:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-01-20 10:40:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-01-20 10:40:44,810 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-01-20 10:40:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:44,810 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-01-20 10:40:44,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:40:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-01-20 10:40:44,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:40:44,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:44,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:40:44,812 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:44,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:44,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-01-20 10:40:44,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:44,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:44,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:44,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:44,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:44,963 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:40:45,124 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-20 10:40:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:40:45,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:45,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:45,143 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:40:45,144 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-20 10:40:45,145 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:45,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:45,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:45,476 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:40:45,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:45,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:45,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:45,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:45,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:45,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:45,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:45,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:40:45,543 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 21 treesize of output 27 [2019-01-20 10:40:45,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,549 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 23 treesize of output 37 [2019-01-20 10:40:45,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,560 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:40:45,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:40:45,572 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,589 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,613 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:40:45,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:40:45,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:40:45,703 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,713 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,721 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:45,742 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-20 10:40:45,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:40:45,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:45,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:40:45,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,822 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:45,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 33 treesize of output 60 [2019-01-20 10:40:45,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:45,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-20 10:40:45,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-20 10:40:45,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:45,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-20 10:40:45,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,917 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:45,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-20 10:40:45,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:45,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-20 10:40:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:45,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:46,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:46,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:40:46,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:46,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:40:46,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:40:46,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:40:46,026 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-01-20 10:40:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:49,397 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-01-20 10:40:49,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:40:49,398 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:40:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:49,404 INFO L225 Difference]: With dead ends: 1108 [2019-01-20 10:40:49,404 INFO L226 Difference]: Without dead ends: 1107 [2019-01-20 10:40:49,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:40:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-01-20 10:40:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-01-20 10:40:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-20 10:40:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-01-20 10:40:52,229 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-01-20 10:40:52,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:52,229 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-01-20 10:40:52,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:40:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-01-20 10:40:52,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:40:52,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:52,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:40:52,232 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:52,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:52,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-01-20 10:40:52,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:52,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:52,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:52,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:52,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:40:52,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:52,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:52,342 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:40:52,342 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-20 10:40:52,343 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:52,343 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:52,818 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:52,818 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:40:52,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:52,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:52,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:52,819 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 [2019-01-20 10:40:52,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:52,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:52,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:52,839 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 18 treesize of output 21 [2019-01-20 10:40:52,846 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 21 treesize of output 23 [2019-01-20 10:40:52,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:40:52,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:40:52,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,884 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 27 treesize of output 62 [2019-01-20 10:40:52,884 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,914 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,936 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,966 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 43 treesize of output 39 [2019-01-20 10:40:52,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,983 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 36 treesize of output 49 [2019-01-20 10:40:53,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:40:53,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:40:53,064 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:53,079 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:53,092 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:53,107 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:53,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:53,134 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:40:53,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:40:53,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:53,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. [2019-01-20 10:40:53,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:40:53,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,215 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:53,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:40:53,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:40:53,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:40:53,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-20 10:40:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:53,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:53,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:53,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:40:53,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:53,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:40:53,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:40:53,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:40:53,383 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-01-20 10:40:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:56,407 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-01-20 10:40:56,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:40:56,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:40:56,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:56,412 INFO L225 Difference]: With dead ends: 1075 [2019-01-20 10:40:56,413 INFO L226 Difference]: Without dead ends: 1074 [2019-01-20 10:40:56,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:40:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-01-20 10:40:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-01-20 10:40:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-01-20 10:40:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-01-20 10:40:59,251 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-01-20 10:40:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:59,251 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-01-20 10:40:59,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:40:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-01-20 10:40:59,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:40:59,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:59,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:40:59,253 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:59,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:59,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-01-20 10:40:59,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:59,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:59,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:59,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:59,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:40:59,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:59,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:59,332 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:40:59,332 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-20 10:40:59,333 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:59,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:00,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:00,046 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:41:00,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:00,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:00,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:00,046 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 [2019-01-20 10:41:00,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:00,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:00,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:00,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:41:00,089 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 21 treesize of output 27 [2019-01-20 10:41:00,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,098 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 23 treesize of output 37 [2019-01-20 10:41:00,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,106 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:41:00,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:41:00,119 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,159 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:41:00,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:41:00,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,324 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:41:00,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:41:00,379 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,396 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,414 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,433 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:00,465 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:41:00,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:41:00,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:00,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:41:00,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,697 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:00,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:41:00,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:00,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-20 10:41:00,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:41:00,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:00,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-20 10:41:00,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,827 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:00,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:41:00,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:00,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-20 10:41:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:00,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:00,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:00,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:41:00,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:00,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:41:00,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:41:00,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:41:00,954 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-01-20 10:41:05,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:05,495 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-01-20 10:41:05,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:41:05,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:41:05,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:05,503 INFO L225 Difference]: With dead ends: 1522 [2019-01-20 10:41:05,503 INFO L226 Difference]: Without dead ends: 1521 [2019-01-20 10:41:05,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:41:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-01-20 10:41:08,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-01-20 10:41:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-01-20 10:41:08,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-01-20 10:41:08,651 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-01-20 10:41:08,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:08,651 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-01-20 10:41:08,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:41:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-01-20 10:41:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:41:08,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:08,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:41:08,654 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:08,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-20 10:41:08,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:08,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:08,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:08,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:08,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:08,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:41:08,703 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-20 10:41:08,704 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:08,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:10,041 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:10,041 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:41:10,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:10,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:10,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:10,042 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 [2019-01-20 10:41:10,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:10,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:10,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:10,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21 [2019-01-20 10:41:10,070 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 21 treesize of output 23 [2019-01-20 10:41:10,077 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 23 treesize of output 25 [2019-01-20 10:41:10,092 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-20 10:41:10,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-20 10:41:10,117 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:10,130 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:10,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:10,154 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:10,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:10,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:10,181 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-20 10:41:10,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2019-01-20 10:41:10,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:10,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:10,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-20 10:41:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:10,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:10,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:41:10,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:41:10,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:41:10,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:41:10,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:41:10,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:41:10,270 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-01-20 10:41:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:14,297 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-01-20 10:41:14,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:41:14,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-20 10:41:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:14,306 INFO L225 Difference]: With dead ends: 1559 [2019-01-20 10:41:14,306 INFO L226 Difference]: Without dead ends: 1554 [2019-01-20 10:41:14,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:41:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-01-20 10:41:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-01-20 10:41:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-01-20 10:41:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-01-20 10:41:18,607 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-01-20 10:41:18,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:18,607 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-01-20 10:41:18,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:41:18,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-01-20 10:41:18,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:41:18,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:18,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:41:18,610 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:18,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:18,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-20 10:41:18,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:18,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:18,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:18,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:18,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:41:18,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:18,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:18,670 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:41:18,670 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-20 10:41:18,671 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:18,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:19,142 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:19,142 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:41:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:19,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:19,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:19,143 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:19,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:19,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:19,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:19,166 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 18 treesize of output 21 [2019-01-20 10:41:19,170 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 21 treesize of output 23 [2019-01-20 10:41:19,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:41:19,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:41:19,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,204 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 27 treesize of output 62 [2019-01-20 10:41:19,205 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:19,242 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:19,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:19,266 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:19,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:19,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:41:19,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,313 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 36 treesize of output 49 [2019-01-20 10:41:19,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:41:19,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:41:19,395 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:19,409 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:19,423 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:19,438 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:19,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:19,466 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:41:19,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:41:19,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:19,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:19,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:41:19,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:19,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:41:19,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:41:19,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:41:19,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-20 10:41:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:19,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:19,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:19,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:41:19,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:19,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:41:19,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:41:19,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:41:19,733 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-01-20 10:41:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:24,106 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-01-20 10:41:24,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:41:24,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:41:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:24,113 INFO L225 Difference]: With dead ends: 1574 [2019-01-20 10:41:24,113 INFO L226 Difference]: Without dead ends: 1570 [2019-01-20 10:41:24,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:41:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-01-20 10:41:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-01-20 10:41:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-01-20 10:41:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-01-20 10:41:28,501 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-01-20 10:41:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:28,501 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-01-20 10:41:28,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:41:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-01-20 10:41:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:41:28,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:28,503 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:41:28,503 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:28,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:28,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-01-20 10:41:28,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:28,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:28,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:28,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:28,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:41:28,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:28,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:28,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:41:28,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:41:28,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:28,689 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:28,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:41:28,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:41:28,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:41:28,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:41:28,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:28,709 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 18 treesize of output 21 [2019-01-20 10:41:28,715 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 21 treesize of output 23 [2019-01-20 10:41:28,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:41:28,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:41:28,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,748 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 27 treesize of output 62 [2019-01-20 10:41:28,749 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:28,773 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:28,786 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:28,796 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:28,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:28,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:41:28,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,842 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 36 treesize of output 49 [2019-01-20 10:41:28,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:41:28,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:28,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:41:28,924 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:28,938 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:28,953 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:28,969 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:28,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:28,997 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:41:29,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:41:29,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:29,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:29,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-20 10:41:29,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:41:29,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:41:29,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:41:29,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-20 10:41:29,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,233 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:29,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 77 [2019-01-20 10:41:29,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:29,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. [2019-01-20 10:41:29,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-01-20 10:41:29,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-20 10:41:29,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:29,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:29,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-20 10:41:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:29,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:29,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:29,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:41:29,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:29,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:41:29,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:41:29,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:41:29,404 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-01-20 10:41:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:35,385 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-01-20 10:41:35,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:41:35,385 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:41:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:35,390 INFO L225 Difference]: With dead ends: 2098 [2019-01-20 10:41:35,390 INFO L226 Difference]: Without dead ends: 2091 [2019-01-20 10:41:35,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:41:35,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-01-20 10:41:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-01-20 10:41:40,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-20 10:41:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-01-20 10:41:40,523 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-01-20 10:41:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:40,523 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-01-20 10:41:40,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:41:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-01-20 10:41:40,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:41:40,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:40,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:41:40,527 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:40,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:40,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-01-20 10:41:40,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:40,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:40,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:41:40,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:40,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:40,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:40,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:40,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:40,598 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:41:40,598 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-20 10:41:40,599 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:40,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:41,127 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:41,128 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:41:41,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:41,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:41,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:41,128 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:41,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:41,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:41,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:41,171 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 18 treesize of output 21 [2019-01-20 10:41:41,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:41:41,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:41:41,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:41:41,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,207 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 27 treesize of output 62 [2019-01-20 10:41:41,207 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:41,233 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:41,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:41,258 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:41,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:41,290 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 43 treesize of output 39 [2019-01-20 10:41:41,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,305 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 36 treesize of output 49 [2019-01-20 10:41:41,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:41:41,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:41:41,389 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:41,404 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:41,419 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:41,435 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:41,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:41,464 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:41:41,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:41:41,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:41,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:41,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:41:41,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:41,566 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:41,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-20 10:41:41,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:41,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:41,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-20 10:41:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:41,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:41,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:41,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:41:41,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:41,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:41:41,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:41:41,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:41:41,648 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-01-20 10:41:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:46,690 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-01-20 10:41:46,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:41:46,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:41:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:46,695 INFO L225 Difference]: With dead ends: 1846 [2019-01-20 10:41:46,695 INFO L226 Difference]: Without dead ends: 1839 [2019-01-20 10:41:46,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:41:46,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-01-20 10:41:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-01-20 10:41:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-20 10:41:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-01-20 10:41:51,944 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-01-20 10:41:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:51,944 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-01-20 10:41:51,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:41:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-01-20 10:41:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:41:51,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:51,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:41:51,947 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:51,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-01-20 10:41:51,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:51,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:51,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:51,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:51,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:41:52,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:52,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:52,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:41:52,070 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-20 10:41:52,071 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:52,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:52,331 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:52,332 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:41:52,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:52,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:52,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:52,332 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:52,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:52,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:52,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:52,353 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 18 treesize of output 21 [2019-01-20 10:41:52,360 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 21 treesize of output 23 [2019-01-20 10:41:52,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:41:52,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:41:52,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:41:52,403 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:52,435 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:52,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:52,460 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:52,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:52,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:41:52,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,505 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 36 treesize of output 49 [2019-01-20 10:41:52,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:41:52,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:41:52,587 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:52,602 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:52,616 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:52,633 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:52,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:52,661 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:41:52,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:41:52,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:41:52,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:41:52,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-01-20 10:41:52,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 61 [2019-01-20 10:41:52,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:52,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:52,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 78 [2019-01-20 10:41:52,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:52,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:41:53,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-01-20 10:41:53,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,052 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:53,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-20 10:41:53,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:53,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,114 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:53,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:53,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-01-20 10:41:53,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:53,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:41:53,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-20 10:41:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:53,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:53,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:53,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-20 10:41:53,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:53,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:41:53,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:41:53,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:41:53,361 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-01-20 10:41:55,395 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-01-20 10:42:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:00,426 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-01-20 10:42:00,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:42:00,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:42:00,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:00,432 INFO L225 Difference]: With dead ends: 2193 [2019-01-20 10:42:00,432 INFO L226 Difference]: Without dead ends: 2192 [2019-01-20 10:42:00,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:42:00,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-01-20 10:42:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-01-20 10:42:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-01-20 10:42:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-01-20 10:42:05,978 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-01-20 10:42:05,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:05,978 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-01-20 10:42:05,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:42:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-01-20 10:42:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:42:05,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:05,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:42:05,981 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:05,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-01-20 10:42:05,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:05,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:05,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:05,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:05,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:06,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:06,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:06,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:42:06,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:42:06,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:06,051 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:06,061 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:42:06,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:42:06,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:42:06,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:42:06,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:06,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:42:06,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:42:06,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:42:06,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:42:06,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:06,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:06,382 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:06,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:06,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:42:06,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:42:06,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:42:06,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:42:06,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:42:06,436 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:06,461 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:06,475 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:06,487 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:06,496 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:06,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:06,526 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:42:06,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:42:06,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:06,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:06,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:42:06,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:42:06,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:06,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:06,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-20 10:42:06,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,691 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:06,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:42:06,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:06,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:06,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-20 10:42:06,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:06,788 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:06,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:42:06,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:06,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:06,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-20 10:42:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:06,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:06,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:06,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:42:06,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:06,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:42:06,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:42:06,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:42:06,906 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-01-20 10:42:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:14,108 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-01-20 10:42:14,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:42:14,109 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:42:14,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:14,115 INFO L225 Difference]: With dead ends: 2526 [2019-01-20 10:42:14,115 INFO L226 Difference]: Without dead ends: 2520 [2019-01-20 10:42:14,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:42:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-01-20 10:42:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-01-20 10:42:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-01-20 10:42:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-01-20 10:42:19,824 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-01-20 10:42:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:19,825 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-01-20 10:42:19,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:42:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-01-20 10:42:19,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:42:19,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:19,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:42:19,828 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:19,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-01-20 10:42:19,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:19,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:19,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:42:19,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:19,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:20,016 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-20 10:42:20,256 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-20 10:42:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:42:20,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:20,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:20,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:42:20,277 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-01-20 10:42:20,278 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:42:20,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:42:20,479 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:42:20,479 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:42:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:20,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:42:20,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:20,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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:20,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:20,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:42:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:20,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:20,501 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 18 treesize of output 21 [2019-01-20 10:42:20,507 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 21 treesize of output 23 [2019-01-20 10:42:20,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:42:20,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:42:20,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,547 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 27 treesize of output 62 [2019-01-20 10:42:20,548 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:20,576 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:20,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:20,599 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:20,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:20,630 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 43 treesize of output 39 [2019-01-20 10:42:20,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,646 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 36 treesize of output 49 [2019-01-20 10:42:20,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:42:20,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:42:20,726 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:20,740 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:20,753 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:20,769 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:20,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:20,796 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:42:20,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:42:20,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:42:20,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:42:20,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-01-20 10:42:20,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,032 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:21,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-20 10:42:21,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:21,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:21,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-01-20 10:42:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:21,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:21,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:21,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-20 10:42:21,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:21,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:42:21,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:42:21,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:42:21,129 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-01-20 10:42:26,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:26,765 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-01-20 10:42:26,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:42:26,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-20 10:42:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:26,771 INFO L225 Difference]: With dead ends: 1971 [2019-01-20 10:42:26,771 INFO L226 Difference]: Without dead ends: 1964 [2019-01-20 10:42:26,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:42:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-01-20 10:42:32,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-01-20 10:42:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-01-20 10:42:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-01-20 10:42:32,503 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-01-20 10:42:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:32,504 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-01-20 10:42:32,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:42:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-01-20 10:42:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:42:32,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:32,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:42:32,508 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:32,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:32,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-01-20 10:42:32,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:32,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:32,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:32,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:32,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:32,650 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:42:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:42:32,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:32,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:32,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:42:32,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:42:32,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:32,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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:32,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:42:32,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:42:32,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:42:32,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:42:32,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:32,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21 [2019-01-20 10:42:32,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:42:32,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:42:32,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:42:32,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,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 27 treesize of output 62 [2019-01-20 10:42:32,794 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,820 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,843 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,873 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 43 treesize of output 39 [2019-01-20 10:42:32,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:42:32,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:42:32,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:42:32,970 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,985 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,998 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:33,014 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:33,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:33,041 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:42:33,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:42:33,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:33,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:33,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:42:33,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:42:33,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:33,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:33,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:42:33,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:33,176 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:33,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-20 10:42:33,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:33,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:33,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:42:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:33,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:33,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:33,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:42:33,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:33,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:42:33,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:42:33,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:42:33,274 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-01-20 10:42:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:39,230 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-01-20 10:42:39,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:42:39,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-20 10:42:39,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:39,236 INFO L225 Difference]: With dead ends: 2036 [2019-01-20 10:42:39,236 INFO L226 Difference]: Without dead ends: 2033 [2019-01-20 10:42:39,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:42:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-01-20 10:42:45,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-01-20 10:42:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-01-20 10:42:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-01-20 10:42:45,105 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-01-20 10:42:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:45,105 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-01-20 10:42:45,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:42:45,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-01-20 10:42:45,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:42:45,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:45,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:42:45,108 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:45,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-01-20 10:42:45,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:45,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:45,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:42:45,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:45,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:42:45,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:45,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:45,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:42:45,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:42:45,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:45,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:45,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:42:45,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:42:45,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:42:45,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:42:45,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:45,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:42:45,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:42:45,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:42:45,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:45,296 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:45,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:45,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:42:45,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:42:45,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:42:45,353 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:42:45,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:42:45,361 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:45,379 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:45,393 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:45,404 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:45,413 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:45,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:45,435 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-20 10:42:45,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-20 10:42:45,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:42:45,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-20 10:42:45,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-01-20 10:42:45,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-20 10:42:45,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-20 10:42:45,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:45,852 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:45,853 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 45 treesize of output 59 [2019-01-20 10:42:45,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:45,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-20 10:42:45,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-01-20 10:42:46,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,104 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 55 treesize of output 57 [2019-01-20 10:42:46,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:46,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-20 10:42:46,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:46,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,469 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:46,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-20 10:42:46,470 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:46,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,549 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:46,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 71 [2019-01-20 10:42:46,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:46,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-20 10:42:46,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-01-20 10:42:46,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,690 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:46,690 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 43 treesize of output 55 [2019-01-20 10:42:46,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:46,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-20 10:42:46,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:46,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,853 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:46,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-20 10:42:46,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:46,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:46,934 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 37 treesize of output 93 [2019-01-20 10:42:46,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:47,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-20 10:42:47,002 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-01-20 10:42:47,273 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-01-20 10:42:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:47,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:47,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:47,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:42:47,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:47,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:42:47,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:42:47,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:42:47,419 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-01-20 10:42:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:56,781 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-01-20 10:42:56,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:42:56,782 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:42:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:56,789 INFO L225 Difference]: With dead ends: 2952 [2019-01-20 10:42:56,789 INFO L226 Difference]: Without dead ends: 2951 [2019-01-20 10:42:56,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:42:56,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-01-20 10:43:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-01-20 10:43:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-01-20 10:43:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-01-20 10:43:02,072 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-01-20 10:43:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:43:02,072 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-01-20 10:43:02,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:43:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-01-20 10:43:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:43:02,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:43:02,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:43:02,075 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:43:02,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:02,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-20 10:43:02,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:43:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:02,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:43:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:02,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:43:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:02,361 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-20 10:43:02,655 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-01-20 10:43:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:43:02,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:02,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:43:02,711 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:43:02,711 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-20 10:43:02,712 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:43:02,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:43:02,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:43:02,910 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:43:02,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:02,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:43:02,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:02,910 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:43:02,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:02,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:43:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:02,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:43:02,933 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 43 treesize of output 39 [2019-01-20 10:43:02,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:02,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:02,961 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 36 treesize of output 49 [2019-01-20 10:43:03,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:43:03,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:43:03,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:03,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:03,088 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:03,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:03,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:43:03,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:43:03,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:43:03,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:43:03,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:43:03,139 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:03,160 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:03,172 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:03,181 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:03,191 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:03,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:03,218 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:43:03,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:43:03,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:43:03,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:43:03,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-20 10:43:03,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,422 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:03,423 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 49 treesize of output 59 [2019-01-20 10:43:03,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:03,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:03,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-20 10:43:03,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:03,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:43:03,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-01-20 10:43:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:03,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:43:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:03,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:43:03,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-20 10:43:03,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:43:03,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:43:03,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:43:03,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:43:03,647 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-01-20 10:43:07,132 WARN L181 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-20 10:43:07,318 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-01-20 10:43:09,450 WARN L181 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-01-20 10:43:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:43:15,209 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-01-20 10:43:15,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:43:15,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:43:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:43:15,214 INFO L225 Difference]: With dead ends: 1903 [2019-01-20 10:43:15,215 INFO L226 Difference]: Without dead ends: 1896 [2019-01-20 10:43:15,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:43:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-20 10:43:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-01-20 10:43:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-01-20 10:43:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-01-20 10:43:21,077 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-01-20 10:43:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:43:21,077 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-01-20 10:43:21,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:43:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-01-20 10:43:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:43:21,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:43:21,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:43:21,080 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:43:21,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:21,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-01-20 10:43:21,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:43:21,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:21,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:21,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:21,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:43:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:43:21,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:21,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:43:21,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:43:21,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:43:21,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:21,172 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:43:21,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:43:21,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:43:21,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 10:43:21,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:43:21,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:43:21,194 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 18 treesize of output 21 [2019-01-20 10:43:21,197 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 21 treesize of output 23 [2019-01-20 10:43:21,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:43:21,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:43:21,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,226 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 27 treesize of output 62 [2019-01-20 10:43:21,226 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:21,252 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:21,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:21,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:21,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:21,306 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 43 treesize of output 39 [2019-01-20 10:43:21,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,336 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 36 treesize of output 49 [2019-01-20 10:43:21,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:43:21,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:43:21,419 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:21,434 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:21,449 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:21,464 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:21,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:21,492 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:43:21,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:43:21,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:21,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:21,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:43:21,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:21,571 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:21,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:43:21,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:43:21,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:43:21,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-20 10:43:21,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:21,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:43:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:21,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:43:21,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:43:21,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:43:21,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:43:21,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:43:21,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:43:21,756 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-01-20 10:43:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:43:27,453 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-01-20 10:43:27,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:43:27,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:43:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:43:27,458 INFO L225 Difference]: With dead ends: 1884 [2019-01-20 10:43:27,459 INFO L226 Difference]: Without dead ends: 1877 [2019-01-20 10:43:27,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:43:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-01-20 10:43:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-01-20 10:43:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-01-20 10:43:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-01-20 10:43:33,539 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-01-20 10:43:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:43:33,539 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-01-20 10:43:33,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:43:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-01-20 10:43:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:43:33,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:43:33,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:43:33,542 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:43:33,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:33,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-01-20 10:43:33,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:43:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:33,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:43:33,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:33,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:43:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:33,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:33,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:43:33,678 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:43:33,679 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-20 10:43:33,679 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:43:33,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:43:34,033 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:43:34,033 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:43:34,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:34,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:43:34,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:34,034 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:43:34,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:34,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:43:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:34,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:43:34,053 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 43 treesize of output 39 [2019-01-20 10:43:34,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,078 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 36 treesize of output 49 [2019-01-20 10:43:34,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:43:34,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:43:34,179 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:34,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:34,214 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:34,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:34,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:43:34,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:43:34,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:43:34,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:43:34,270 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 27 treesize of output 62 [2019-01-20 10:43:34,271 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:34,292 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:34,305 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:34,315 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:34,325 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:34,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:34,354 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:43:34,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:43:34,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:34,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:34,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-20 10:43:34,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-20 10:43:34,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:34,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:34,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-20 10:43:34,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:34,532 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:34,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 94 [2019-01-20 10:43:34,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:43:34,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:43:34,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-20 10:43:34,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:34,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:43:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:34,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:43:34,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-20 10:43:34,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:43:34,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:43:34,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:43:34,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:43:34,738 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-01-20 10:43:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:43:43,830 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-01-20 10:43:43,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:43:43,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 10:43:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:43:43,838 INFO L225 Difference]: With dead ends: 2991 [2019-01-20 10:43:43,839 INFO L226 Difference]: Without dead ends: 2978 [2019-01-20 10:43:43,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:43:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-01-20 10:43:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-01-20 10:43:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-01-20 10:43:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-01-20 10:43:51,979 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-01-20 10:43:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:43:51,980 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-01-20 10:43:51,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:43:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-01-20 10:43:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:43:51,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:43:51,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:43:51,984 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:43:51,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:51,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-01-20 10:43:51,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:43:51,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:51,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:51,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:51,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:43:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:52,070 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:43:52,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:52,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:43:52,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:43:52,071 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-20 10:43:52,072 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:43:52,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:43:52,474 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:43:52,474 INFO L272 AbstractInterpreter]: Visited 8 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-01-20 10:43:52,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:52,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:43:52,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:52,475 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:43:52,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:52,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:43:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:52,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:43:52,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:43:52,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:43:52,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,601 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:43:52,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:43:52,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:52,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:52,685 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:52,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:52,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:43:52,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:43:52,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:43:52,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:43:52,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:43:52,734 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:52,757 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:52,771 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:52,782 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:52,792 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:52,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:52,823 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-20 10:43:52,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:43:52,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:52,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:52,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-20 10:43:52,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:43:52,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:52,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:52,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-20 10:43:52,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:52,992 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:52,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-20 10:43:52,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:53,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:53,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-20 10:43:53,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,066 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:53,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-20 10:43:53,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:53,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:53,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-01-20 10:43:53,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:53,141 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:53,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-20 10:43:53,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:53,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:53,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-20 10:43:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:53,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:43:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:53,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:43:53,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-20 10:43:53,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:43:53,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:43:53,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:43:53,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:43:53,866 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-01-20 10:44:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:44:05,926 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-01-20 10:44:05,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:44:05,926 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-20 10:44:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:44:05,934 INFO L225 Difference]: With dead ends: 3181 [2019-01-20 10:44:05,935 INFO L226 Difference]: Without dead ends: 3179 [2019-01-20 10:44:05,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:44:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-01-20 10:44:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-01-20 10:44:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-20 10:44:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-01-20 10:44:13,586 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-01-20 10:44:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:44:13,586 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-01-20 10:44:13,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:44:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-01-20 10:44:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:44:13,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:44:13,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:44:13,591 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:44:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:44:13,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-01-20 10:44:13,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:44:13,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:13,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:44:13,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:13,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:44:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:44:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:44:13,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:44:13,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 10:44:13,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:44:13,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:44:13,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:44:13,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:44:13,685 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-01-20 10:44:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:44:20,790 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-01-20 10:44:20,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:44:20,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-20 10:44:20,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:44:20,797 INFO L225 Difference]: With dead ends: 2346 [2019-01-20 10:44:20,797 INFO L226 Difference]: Without dead ends: 2337 [2019-01-20 10:44:20,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:44:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-01-20 10:44:28,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-01-20 10:44:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-20 10:44:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-01-20 10:44:28,420 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-01-20 10:44:28,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:44:28,420 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-01-20 10:44:28,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:44:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-01-20 10:44:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:44:28,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:44:28,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:44:28,424 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:44:28,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:44:28,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-01-20 10:44:28,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:44:28,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:28,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:44:28,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:28,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:44:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:44:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:44:28,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:28,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:44:28,573 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:44:28,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:44:28,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:28,574 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:44:28,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:44:28,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:44:28,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:44:28,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:44:28,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:44:28,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:44:28,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:44:28,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,691 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:44:28,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:44:28,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:28,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:28,774 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:28,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:28,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:44:28,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:44:28,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:44:28,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:44:28,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:44:28,822 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:28,846 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:28,860 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:28,872 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:28,882 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:28,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:28,913 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-20 10:44:28,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:28,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:44:28,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:28,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:28,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-20 10:44:29,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:44:29,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:29,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:29,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-20 10:44:29,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,092 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:44:29,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:44:29,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:29,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:29,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-01-20 10:44:29,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,171 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:44:29,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-20 10:44:29,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:29,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:29,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:44:29,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:29,279 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:44:29,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-20 10:44:29,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:29,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:29,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-20 10:44:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:29,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:44:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:29,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:44:29,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-20 10:44:29,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:44:29,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:44:29,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:44:29,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:44:29,603 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-01-20 10:44:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:44:37,743 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-01-20 10:44:37,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:44:37,744 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-20 10:44:37,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:44:37,750 INFO L225 Difference]: With dead ends: 2345 [2019-01-20 10:44:37,750 INFO L226 Difference]: Without dead ends: 2338 [2019-01-20 10:44:37,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:44:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-01-20 10:44:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-01-20 10:44:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-01-20 10:44:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-01-20 10:44:39,839 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-01-20 10:44:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:44:39,839 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-01-20 10:44:39,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:44:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-01-20 10:44:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:44:39,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:44:39,840 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-20 10:44:39,840 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:44:39,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:44:39,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-01-20 10:44:39,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:44:39,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:39,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:44:39,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:39,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:44:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:44:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:44:39,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:39,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:44:39,953 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:44:39,953 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-20 10:44:39,954 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:44:39,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:44:40,220 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:44:40,220 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:44:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:44:40,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:44:40,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:40,220 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:44:40,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:44:40,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:44:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:44:40,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:44:40,243 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 18 treesize of output 21 [2019-01-20 10:44:40,251 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 21 treesize of output 23 [2019-01-20 10:44:40,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:44:40,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:44:40,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:44:40,285 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,304 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,334 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:44:40,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:44:40,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:44:40,500 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,546 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,554 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:40,574 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-20 10:44:40,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:44:40,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-20 10:44:40,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:44:40,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-01-20 10:44:40,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-20 10:44:40,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:40,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-01-20 10:44:40,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:40,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-20 10:44:40,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:40,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:40,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-01-20 10:44:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:40,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:44:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:40,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:44:40,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:44:40,802 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:44:40,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:44:40,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:44:40,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:44:40,803 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-01-20 10:44:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:44:43,150 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-01-20 10:44:43,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:44:43,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 10:44:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:44:43,152 INFO L225 Difference]: With dead ends: 480 [2019-01-20 10:44:43,153 INFO L226 Difference]: Without dead ends: 477 [2019-01-20 10:44:43,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:44:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-20 10:44:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-01-20 10:44:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-20 10:44:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-01-20 10:44:44,068 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-01-20 10:44:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:44:44,068 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-01-20 10:44:44,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:44:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-01-20 10:44:44,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:44:44,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:44:44,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:44:44,069 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:44:44,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:44:44,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-01-20 10:44:44,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:44:44,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:44,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:44:44,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:44,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:44:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:44:44,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:44:44,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:44,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:44:44,141 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:44:44,141 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-20 10:44:44,142 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:44:44,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:44:44,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:44:44,422 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:44:44,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:44:44,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:44:44,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:44,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:44:44,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:44:44,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:44:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:44:44,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:44:44,448 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 18 treesize of output 21 [2019-01-20 10:44:44,452 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 21 treesize of output 23 [2019-01-20 10:44:44,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:44:44,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:44:44,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:44:44,487 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:44,518 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:44,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:44,542 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:44,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:44,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:44:44,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,590 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 36 treesize of output 49 [2019-01-20 10:44:44,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:44:44,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:44:44,685 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:44,700 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:44,714 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:44,730 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:44,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:44,759 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:44:44,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:44:44,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:44,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:44,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:44:44,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:44,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:44:44,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:44,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:44,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:44:45,099 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-20 10:44:45,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:45,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:45,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:45,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:45,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:45,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:45,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:45,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:45,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:45,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:45,287 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:44:45,287 INFO L303 Elim1Store]: Index analysis took 186 ms [2019-01-20 10:44:45,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-20 10:44:45,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:45,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:45,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:44:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:45,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:44:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:45,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:44:45,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:44:45,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:44:45,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:44:45,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:44:45,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:44:45,379 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-01-20 10:44:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:44:47,226 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-01-20 10:44:47,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:44:47,227 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-20 10:44:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:44:47,227 INFO L225 Difference]: With dead ends: 250 [2019-01-20 10:44:47,227 INFO L226 Difference]: Without dead ends: 243 [2019-01-20 10:44:47,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:44:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-20 10:44:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-01-20 10:44:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-20 10:44:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-01-20 10:44:48,728 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-01-20 10:44:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:44:48,728 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-01-20 10:44:48,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:44:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-01-20 10:44:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:44:48,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:44:48,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:44:48,729 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:44:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:44:48,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-01-20 10:44:48,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:44:48,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:48,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:44:48,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:48,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:44:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:44:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:44:48,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:48,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:44:48,861 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:44:48,861 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-20 10:44:48,862 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:44:48,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:44:49,125 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:44:49,126 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:44:49,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:44:49,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:44:49,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:49,126 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:44:49,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:44:49,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:44:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:44:49,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:44:49,144 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 18 treesize of output 21 [2019-01-20 10:44:49,149 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 21 treesize of output 23 [2019-01-20 10:44:49,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:44:49,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:44:49,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:44:49,190 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:49,214 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:49,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:49,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:49,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:49,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:44:49,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:44:49,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:44:49,308 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:49,317 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:49,326 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:49,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:49,346 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-20 10:44:49,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:44:49,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:49,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:49,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-20 10:44:49,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:44:49,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:49,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:49,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-20 10:44:49,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:49,441 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:44:49,442 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 56 [2019-01-20 10:44:49,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:49,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:49,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-20 10:44:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:49,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:44:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:49,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:44:49,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:44:49,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:44:49,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:44:49,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:44:49,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:44:49,522 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-01-20 10:44:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:44:52,765 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-01-20 10:44:52,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:44:52,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-20 10:44:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:44:52,767 INFO L225 Difference]: With dead ends: 372 [2019-01-20 10:44:52,767 INFO L226 Difference]: Without dead ends: 362 [2019-01-20 10:44:52,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:44:52,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-01-20 10:44:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-01-20 10:44:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-01-20 10:44:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-01-20 10:44:55,059 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-01-20 10:44:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:44:55,059 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-01-20 10:44:55,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:44:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-01-20 10:44:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:44:55,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:44:55,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:44:55,061 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:44:55,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:44:55,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-01-20 10:44:55,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:44:55,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:55,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:44:55,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:55,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:44:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:44:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:55,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:55,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:44:55,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:44:55,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:44:55,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:55,161 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:44:55,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:44:55,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:44:55,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:44:55,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:44:55,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:44:55,184 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 18 treesize of output 21 [2019-01-20 10:44:55,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:44:55,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:44:55,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:44:55,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,217 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 27 treesize of output 62 [2019-01-20 10:44:55,217 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:55,243 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:55,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:55,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:55,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:55,299 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 43 treesize of output 39 [2019-01-20 10:44:55,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,317 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 36 treesize of output 49 [2019-01-20 10:44:55,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:44:55,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:44:55,401 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:55,417 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:55,432 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:55,448 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:55,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:55,478 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:44:55,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:44:55,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:55,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:55,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:44:55,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,573 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:44:55,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:44:55,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:44:55,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:44:55,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-20 10:44:55,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:55,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:44:55,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:55,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:55,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-20 10:44:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:55,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:44:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:55,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:44:55,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:44:55,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:44:55,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:44:55,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:44:55,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:44:55,826 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-01-20 10:44:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:44:58,756 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-01-20 10:44:58,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:44:58,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-20 10:44:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:44:58,758 INFO L225 Difference]: With dead ends: 332 [2019-01-20 10:44:58,759 INFO L226 Difference]: Without dead ends: 325 [2019-01-20 10:44:58,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:44:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-20 10:45:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-01-20 10:45:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-20 10:45:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-01-20 10:45:01,177 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-01-20 10:45:01,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:45:01,178 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-01-20 10:45:01,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:45:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-01-20 10:45:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:45:01,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:45:01,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:45:01,179 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:45:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:01,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-01-20 10:45:01,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:45:01,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:01,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:45:01,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:01,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:45:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:45:01,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:01,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:45:01,252 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:45:01,252 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-20 10:45:01,252 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:45:01,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:45:01,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:45:01,835 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:45:01,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:01,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:45:01,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:01,835 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:45:01,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:01,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:45:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:01,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:45:01,850 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 43 treesize of output 39 [2019-01-20 10:45:01,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:01,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:01,875 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 36 treesize of output 49 [2019-01-20 10:45:01,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:01,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:01,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:01,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:01,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:45:01,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:01,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:01,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:01,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:01,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:01,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:01,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:45:01,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:01,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:02,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:02,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:02,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:45:02,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:45:02,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:45:02,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:45:02,059 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 27 treesize of output 62 [2019-01-20 10:45:02,059 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:02,080 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:02,093 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:02,101 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:02,111 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:02,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:02,140 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:45:02,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:02,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:45:02,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:02,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:02,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:45:02,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:02,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:02,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:02,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:02,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:02,240 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:02,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-20 10:45:02,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:02,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:02,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-20 10:45:02,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:02,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:02,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:02,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:02,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:02,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:02,287 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:02,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-20 10:45:02,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:02,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:02,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-20 10:45:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:02,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:45:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:02,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:45:02,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:45:02,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:45:02,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:45:02,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:45:02,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:45:02,391 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-01-20 10:45:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:45:05,083 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-01-20 10:45:05,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:45:05,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-20 10:45:05,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:45:05,085 INFO L225 Difference]: With dead ends: 294 [2019-01-20 10:45:05,085 INFO L226 Difference]: Without dead ends: 287 [2019-01-20 10:45:05,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:45:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-20 10:45:07,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-01-20 10:45:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-20 10:45:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-01-20 10:45:07,498 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-01-20 10:45:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:45:07,498 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-01-20 10:45:07,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:45:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-01-20 10:45:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:45:07,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:45:07,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:45:07,499 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:45:07,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:07,499 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-01-20 10:45:07,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:45:07,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:07,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:07,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:07,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:45:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:07,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:45:07,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:07,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:45:07,613 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:45:07,613 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-20 10:45:07,614 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:45:07,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:45:08,219 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:45:08,219 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:45:08,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:08,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:45:08,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:08,220 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:45:08,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:08,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:45:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:08,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:45:08,240 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 18 treesize of output 21 [2019-01-20 10:45:08,244 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 21 treesize of output 23 [2019-01-20 10:45:08,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:45:08,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:45:08,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,285 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 27 treesize of output 62 [2019-01-20 10:45:08,286 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:08,324 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:08,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:08,349 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:08,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:08,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:45:08,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,399 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 36 treesize of output 49 [2019-01-20 10:45:08,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:45:08,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:45:08,481 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:08,496 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:08,511 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:08,527 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:08,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:08,556 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:45:08,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:45:08,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:08,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:08,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-20 10:45:08,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:45:08,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:45:08,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:45:08,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-01-20 10:45:08,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,844 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:08,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,845 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 41 treesize of output 69 [2019-01-20 10:45:08,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:08,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:08,908 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:08,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-20 10:45:08,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:08,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:45:08,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-01-20 10:45:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:09,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:45:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:09,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:45:09,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-20 10:45:09,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:45:09,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:45:09,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:45:09,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:45:09,115 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-01-20 10:45:09,610 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-01-20 10:45:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:45:12,743 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-01-20 10:45:12,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:45:12,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 10:45:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:45:12,745 INFO L225 Difference]: With dead ends: 364 [2019-01-20 10:45:12,746 INFO L226 Difference]: Without dead ends: 357 [2019-01-20 10:45:12,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:45:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-01-20 10:45:15,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-01-20 10:45:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-01-20 10:45:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-01-20 10:45:15,234 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-01-20 10:45:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:45:15,235 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-01-20 10:45:15,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:45:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-01-20 10:45:15,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:45:15,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:45:15,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:45:15,236 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:45:15,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:15,236 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-01-20 10:45:15,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:45:15,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:15,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:15,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:15,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:45:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:15,462 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-01-20 10:45:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:45:15,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:15,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:45:15,496 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:45:15,496 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-20 10:45:15,497 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:45:15,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:45:16,087 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:45:16,087 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:45:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:16,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:45:16,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:16,087 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:45:16,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:16,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:45:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:16,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:45:16,117 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 18 treesize of output 21 [2019-01-20 10:45:16,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:45:16,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:45:16,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:45:16,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,163 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 27 treesize of output 62 [2019-01-20 10:45:16,164 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:16,190 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:16,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:16,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:16,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:16,247 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 43 treesize of output 39 [2019-01-20 10:45:16,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,265 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 36 treesize of output 49 [2019-01-20 10:45:16,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:45:16,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:45:16,350 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:16,365 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:16,380 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:16,396 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:16,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:16,425 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:45:16,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:45:16,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:16,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:16,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:45:16,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-20 10:45:16,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:16,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:16,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-20 10:45:16,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:16,568 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:16,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-20 10:45:16,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:16,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:16,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:45:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:16,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:45:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:16,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:45:16,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:45:16,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:45:16,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:45:16,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:45:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:45:16,663 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-01-20 10:45:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:45:19,750 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-01-20 10:45:19,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:45:19,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-20 10:45:19,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:45:19,752 INFO L225 Difference]: With dead ends: 319 [2019-01-20 10:45:19,752 INFO L226 Difference]: Without dead ends: 312 [2019-01-20 10:45:19,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:45:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-20 10:45:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-01-20 10:45:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-01-20 10:45:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-01-20 10:45:22,645 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-01-20 10:45:22,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:45:22,645 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-01-20 10:45:22,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:45:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-01-20 10:45:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:45:22,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:45:22,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:45:22,646 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:45:22,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:22,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-01-20 10:45:22,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:45:22,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:22,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:22,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:22,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:45:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:45:22,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:22,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:45:22,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:45:22,772 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-20 10:45:22,773 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:45:22,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:45:23,034 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:45:23,034 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:45:23,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:23,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:45:23,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:23,034 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:45:23,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:23,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:45:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:23,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:45:23,050 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 43 treesize of output 39 [2019-01-20 10:45:23,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,076 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 36 treesize of output 49 [2019-01-20 10:45:23,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:45:23,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:45:23,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:23,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:23,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:23,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:23,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:45:23,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:45:23,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:45:23,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:45:23,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:45:23,278 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:23,300 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:23,311 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:23,321 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:23,331 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:23,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:23,361 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:45:23,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:45:23,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:45:23,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:45:23,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-20 10:45:23,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,592 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 45 treesize of output 67 [2019-01-20 10:45:23,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:23,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-20 10:45:23,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:23,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:45:23,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-01-20 10:45:23,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,757 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:23,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-20 10:45:23,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:23,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,821 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:23,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:23,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-01-20 10:45:23,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:23,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:45:23,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-20 10:45:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:23,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:45:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:23,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:45:23,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-20 10:45:23,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:45:23,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:45:23,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:45:23,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:45:23,976 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-01-20 10:45:25,310 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-01-20 10:45:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:45:28,345 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-01-20 10:45:28,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:45:28,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 10:45:28,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:45:28,347 INFO L225 Difference]: With dead ends: 392 [2019-01-20 10:45:28,347 INFO L226 Difference]: Without dead ends: 386 [2019-01-20 10:45:28,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:45:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-20 10:45:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-01-20 10:45:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-20 10:45:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-01-20 10:45:31,477 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-01-20 10:45:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:45:31,477 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-01-20 10:45:31,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:45:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-01-20 10:45:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:45:31,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:45:31,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:45:31,478 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:45:31,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:31,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-20 10:45:31,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:45:31,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:31,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:31,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:31,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:45:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:45:31,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:45:31,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 10:45:31,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:45:31,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:45:31,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:45:31,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:45:31,570 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-01-20 10:45:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:45:34,507 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-01-20 10:45:34,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:45:34,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-20 10:45:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:45:34,509 INFO L225 Difference]: With dead ends: 320 [2019-01-20 10:45:34,509 INFO L226 Difference]: Without dead ends: 315 [2019-01-20 10:45:34,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:45:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-20 10:45:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-01-20 10:45:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-20 10:45:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-01-20 10:45:37,591 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-01-20 10:45:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:45:37,591 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-01-20 10:45:37,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:45:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-01-20 10:45:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:45:37,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:45:37,592 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:45:37,592 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:45:37,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:37,592 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-01-20 10:45:37,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:45:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:37,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:37,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:45:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:45:37,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:37,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:45:37,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:45:37,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:45:37,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:37,688 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:45:37,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:45:37,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:45:37,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:45:37,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:45:37,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:45:37,708 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 43 treesize of output 39 [2019-01-20 10:45:37,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:37,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:37,727 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 36 treesize of output 49 [2019-01-20 10:45:37,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:37,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:37,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:37,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:37,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:45:37,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:37,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:37,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:37,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:37,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:37,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:37,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:45:37,812 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:37,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:37,840 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:37,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:37,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:45:37,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:45:37,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:45:37,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:45:37,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:45:37,891 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:37,914 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:37,927 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:37,937 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:37,947 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:37,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:37,975 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:45:38,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:45:38,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:38,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:38,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-20 10:45:38,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-01-20 10:45:38,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:38,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:38,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-01-20 10:45:38,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:45:38,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:45:38,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:45:38,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-20 10:45:38,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:38,350 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:38,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-20 10:45:38,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:38,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:38,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:45:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:38,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:45:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:38,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:45:38,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:45:38,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:45:38,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:45:38,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:45:38,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:45:38,486 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-01-20 10:45:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:45:44,906 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-01-20 10:45:44,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:45:44,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:45:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:45:44,908 INFO L225 Difference]: With dead ends: 601 [2019-01-20 10:45:44,908 INFO L226 Difference]: Without dead ends: 591 [2019-01-20 10:45:44,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:45:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-01-20 10:45:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-01-20 10:45:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-20 10:45:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-01-20 10:45:50,018 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-01-20 10:45:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:45:50,019 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-01-20 10:45:50,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:45:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-01-20 10:45:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:45:50,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:45:50,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:45:50,020 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:45:50,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:50,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-01-20 10:45:50,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:45:50,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:50,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:45:50,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:50,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:45:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:45:50,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:50,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:45:50,110 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:45:50,110 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-20 10:45:50,111 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:45:50,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:45:50,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:45:50,392 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:45:50,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:50,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:45:50,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:50,392 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:45:50,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:50,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:45:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:50,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:45:50,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:45:50,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,442 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 36 treesize of output 49 [2019-01-20 10:45:50,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:45:50,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:45:50,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:50,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:50,574 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:50,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:50,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:45:50,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:45:50,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:45:50,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:45:50,631 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 27 treesize of output 62 [2019-01-20 10:45:50,632 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:50,654 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:50,667 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:50,677 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:50,687 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:50,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:50,715 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:45:50,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:45:50,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:50,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:50,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:45:50,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-20 10:45:50,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:50,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:50,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-20 10:45:50,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,859 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:50,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:50,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 93 [2019-01-20 10:45:50,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:45:50,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:45:50,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-20 10:45:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:51,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:45:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:51,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:45:51,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:45:51,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:45:51,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:45:51,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:45:51,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:45:51,060 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-01-20 10:46:00,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:46:00,807 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-01-20 10:46:00,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:46:00,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-20 10:46:00,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:46:00,809 INFO L225 Difference]: With dead ends: 731 [2019-01-20 10:46:00,809 INFO L226 Difference]: Without dead ends: 718 [2019-01-20 10:46:00,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:46:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-01-20 10:46:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-01-20 10:46:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-01-20 10:46:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-01-20 10:46:09,234 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-01-20 10:46:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:46:09,234 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-01-20 10:46:09,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:46:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-01-20 10:46:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:46:09,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:46:09,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:46:09,235 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:46:09,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:46:09,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-01-20 10:46:09,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:46:09,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:46:09,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:46:09,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:46:09,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:46:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:46:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:46:09,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:46:09,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:46:09,367 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:46:09,367 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-20 10:46:09,368 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:46:09,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:46:09,722 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:46:09,723 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:46:09,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:46:09,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:46:09,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:46:09,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:46:09,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:46:09,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:46:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:46:09,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:46:09,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 43 treesize of output 39 [2019-01-20 10:46:09,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:09,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:09,786 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 36 treesize of output 49 [2019-01-20 10:46:09,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:09,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:09,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:09,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:09,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:46:09,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:09,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:09,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:09,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:09,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:09,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:09,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:46:09,883 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:09,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:09,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:09,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:09,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:46:09,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:46:09,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:46:09,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:46:09,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:46:09,973 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:10,014 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:10,027 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:10,037 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:10,047 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:10,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:10,075 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:46:10,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:46:10,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:10,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:10,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-01-20 10:46:10,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:46:10,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:10,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:10,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-20 10:46:10,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:10,229 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:46:10,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-20 10:46:10,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:10,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:10,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-20 10:46:12,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:12,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:12,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:12,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:12,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:12,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:12,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:12,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:12,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:12,285 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:46:12,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-20 10:46:12,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:12,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:12,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-01-20 10:46:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:46:12,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:46:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:46:12,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:46:12,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:46:12,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:46:12,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:46:12,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:46:12,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=180, Unknown=1, NotChecked=0, Total=272 [2019-01-20 10:46:12,429 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-01-20 10:46:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:46:22,398 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-01-20 10:46:22,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:46:22,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:46:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:46:22,399 INFO L225 Difference]: With dead ends: 480 [2019-01-20 10:46:22,399 INFO L226 Difference]: Without dead ends: 473 [2019-01-20 10:46:22,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=148, Invalid=313, Unknown=1, NotChecked=0, Total=462 [2019-01-20 10:46:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-01-20 10:46:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-01-20 10:46:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-20 10:46:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-01-20 10:46:25,703 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-01-20 10:46:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:46:25,703 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-01-20 10:46:25,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:46:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-01-20 10:46:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:46:25,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:46:25,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:46:25,704 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:46:25,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:46:25,705 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-20 10:46:25,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:46:25,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:46:25,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:46:25,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:46:25,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:46:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:46:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:46:25,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:46:25,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:46:25,825 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:46:25,825 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-20 10:46:25,826 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:46:25,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:46:26,092 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:46:26,092 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:46:26,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:46:26,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:46:26,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:46:26,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:46:26,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:46:26,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:46:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:46:26,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:46:26,111 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 18 treesize of output 21 [2019-01-20 10:46:26,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:46:26,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:46:26,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:46:26,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:46:26,156 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:26,190 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:26,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:26,214 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:26,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:26,244 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 43 treesize of output 39 [2019-01-20 10:46:26,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,261 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 36 treesize of output 49 [2019-01-20 10:46:26,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:46:26,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:46:26,344 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:26,357 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:26,372 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:26,388 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:26,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:26,416 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:46:26,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:46:26,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:26,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:26,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:46:26,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:46:26,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:26,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:26,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:46:26,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,559 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:46:26,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:26,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-20 10:46:26,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:26,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:26,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:46:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:46:26,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:46:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:46:26,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:46:26,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:46:26,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:46:26,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:46:26,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:46:26,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:46:26,662 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-01-20 10:46:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:46:31,969 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-01-20 10:46:31,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:46:31,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-20 10:46:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:46:31,971 INFO L225 Difference]: With dead ends: 258 [2019-01-20 10:46:31,971 INFO L226 Difference]: Without dead ends: 243 [2019-01-20 10:46:31,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:46:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-20 10:46:36,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-01-20 10:46:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-20 10:46:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-01-20 10:46:36,383 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-01-20 10:46:36,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:46:36,383 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-01-20 10:46:36,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:46:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-01-20 10:46:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:46:36,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:46:36,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:46:36,385 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:46:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:46:36,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-01-20 10:46:36,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:46:36,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:46:36,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:46:36,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:46:36,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:46:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:46:36,528 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2019-01-20 10:46:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:46:36,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:46:36,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:46:36,619 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:46:36,619 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-20 10:46:36,620 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:46:36,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:46:37,323 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:46:37,323 INFO L272 AbstractInterpreter]: Visited 9 different actions 19 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:46:37,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:46:37,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:46:37,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:46:37,324 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:46:37,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:46:37,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:46:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:46:37,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:46:37,348 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 18 treesize of output 21 [2019-01-20 10:46:37,353 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 21 treesize of output 23 [2019-01-20 10:46:37,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:46:37,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:46:37,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,390 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 27 treesize of output 62 [2019-01-20 10:46:37,390 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:37,417 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:37,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:37,443 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:37,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:37,475 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 43 treesize of output 39 [2019-01-20 10:46:37,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,493 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 36 treesize of output 49 [2019-01-20 10:46:37,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:46:37,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:46:37,576 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:37,591 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:37,605 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:37,621 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:37,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:37,650 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-20 10:46:37,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:46:37,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:37,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:37,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-20 10:46:37,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,749 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:46:37,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:46:37,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:46:37,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:46:37,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-20 10:46:37,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,905 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:46:37,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-20 10:46:37,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:37,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:37,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 90 [2019-01-20 10:46:37,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:38,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:46:38,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-01-20 10:46:38,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,081 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:46:38,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-01-20 10:46:38,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:38,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:38,147 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:46:38,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-01-20 10:46:38,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:38,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:46:38,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-01-20 10:46:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:46:38,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:46:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:46:38,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:46:38,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:46:38,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:46:38,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:46:38,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:46:38,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:46:38,305 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-01-20 10:46:38,524 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-01-20 10:46:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:46:44,522 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-01-20 10:46:44,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:46:44,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:46:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:46:44,524 INFO L225 Difference]: With dead ends: 295 [2019-01-20 10:46:44,524 INFO L226 Difference]: Without dead ends: 284 [2019-01-20 10:46:44,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:46:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-20 10:46:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-01-20 10:46:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-20 10:46:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-01-20 10:46:49,170 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-01-20 10:46:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:46:49,170 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-01-20 10:46:49,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:46:49,171 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-01-20 10:46:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:46:49,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:46:49,171 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:46:49,171 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:46:49,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:46:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-20 10:46:49,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:46:49,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:46:49,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:46:49,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:46:49,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:46:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:46:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:46:49,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:46:49,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:46:49,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:46:49,268 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-20 10:46:49,269 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:46:49,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:46:49,768 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:46:49,768 INFO L272 AbstractInterpreter]: Visited 8 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:46:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:46:49,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:46:49,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:46:49,769 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:46:49,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:46:49,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:46:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:46:49,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:46:49,785 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 18 treesize of output 21 [2019-01-20 10:46:49,791 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 21 treesize of output 23 [2019-01-20 10:46:49,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:46:49,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:46:49,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,835 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 27 treesize of output 62 [2019-01-20 10:46:49,835 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:49,862 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:49,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:49,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:49,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:49,921 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 43 treesize of output 39 [2019-01-20 10:46:49,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,938 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 36 treesize of output 49 [2019-01-20 10:46:49,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:49,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:46:50,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:46:50,020 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:50,035 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:50,049 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:50,065 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:50,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:50,094 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-20 10:46:50,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:46:50,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:50,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:50,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:46:50,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:46:50,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:46:50,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:46:50,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-20 10:46:50,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:50,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-20 10:46:50,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:50,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:50,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-01-20 10:46:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:46:50,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:46:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:46:50,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:46:50,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:46:50,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:46:50,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:46:50,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:46:50,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:46:50,416 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-01-20 10:46:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:46:57,395 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-01-20 10:46:57,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:46:57,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-20 10:46:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:46:57,397 INFO L225 Difference]: With dead ends: 328 [2019-01-20 10:46:57,397 INFO L226 Difference]: Without dead ends: 315 [2019-01-20 10:46:57,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:46:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-20 10:47:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-01-20 10:47:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-20 10:47:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-01-20 10:47:04,106 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-01-20 10:47:04,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:47:04,106 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-01-20 10:47:04,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:47:04,106 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-01-20 10:47:04,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:47:04,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:47:04,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:47:04,107 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:47:04,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:47:04,107 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-20 10:47:04,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:47:04,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:47:04,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:47:04,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:47:04,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:47:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:47:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:47:04,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:47:04,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:47:04,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:47:04,237 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-20 10:47:04,237 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:47:04,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:47:04,502 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:47:04,502 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:47:04,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:47:04,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:47:04,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:47:04,502 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:47:04,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:47:04,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:47:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:47:04,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:47:04,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:47:04,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:47:04,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,634 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:47:04,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:47:04,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:04,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:04,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:04,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:04,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:47:04,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:47:04,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:47:04,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:47:04,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:47:04,779 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:04,804 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:04,818 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:04,829 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:04,839 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:04,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:04,870 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:47:04,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:47:04,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:04,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:04,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:47:04,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:04,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-20 10:47:04,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:05,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:05,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-20 10:47:05,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:05,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:05,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:05,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:05,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:05,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:05,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:05,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:05,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:05,040 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:47:05,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:05,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:47:05,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:05,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:05,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-20 10:47:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:47:05,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:47:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:47:05,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:47:05,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:47:05,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:47:05,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:47:05,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:47:05,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:47:05,166 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-01-20 10:47:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:47:14,498 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-01-20 10:47:14,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:47:14,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-20 10:47:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:47:14,500 INFO L225 Difference]: With dead ends: 326 [2019-01-20 10:47:14,500 INFO L226 Difference]: Without dead ends: 313 [2019-01-20 10:47:14,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:47:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-01-20 10:47:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-01-20 10:47:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-20 10:47:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-01-20 10:47:22,601 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-01-20 10:47:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:47:22,601 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-01-20 10:47:22,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:47:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-01-20 10:47:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:47:22,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:47:22,602 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:47:22,602 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:47:22,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:47:22,602 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-01-20 10:47:22,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:47:22,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:47:22,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:47:22,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:47:22,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:47:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:47:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-20 10:47:22,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:47:22,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:47:22,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:47:22,676 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-20 10:47:22,677 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:47:22,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:47:22,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:47:22,959 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:47:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:47:22,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:47:22,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:47:22,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:47:22,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:47:22,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:47:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:47:22,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:47:22,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 18 treesize of output 21 [2019-01-20 10:47:22,989 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 21 treesize of output 23 [2019-01-20 10:47:22,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:47:23,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:47:23,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:47:23,025 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:23,057 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:23,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:23,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:23,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:23,114 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 43 treesize of output 39 [2019-01-20 10:47:23,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,131 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 36 treesize of output 49 [2019-01-20 10:47:23,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:47:23,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:47:23,215 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:23,231 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:23,245 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:23,261 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:23,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:23,290 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:47:23,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:47:23,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:47:23,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:47:23,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-20 10:47:23,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,464 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:47:23,465 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 [2019-01-20 10:47:23,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:23,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:23,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-01-20 10:47:23,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-20 10:47:23,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:23,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:23,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-20 10:47:23,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:23,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 [2019-01-20 10:47:23,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:23,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:23,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-01-20 10:47:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:47:23,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:47:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:47:23,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:47:23,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:47:23,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:47:23,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:47:23,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:47:23,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:47:23,675 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-01-20 10:47:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:47:35,000 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-01-20 10:47:35,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:47:35,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-20 10:47:35,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:47:35,002 INFO L225 Difference]: With dead ends: 400 [2019-01-20 10:47:35,002 INFO L226 Difference]: Without dead ends: 393 [2019-01-20 10:47:35,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:47:35,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-20 10:47:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-01-20 10:47:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-20 10:47:45,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-01-20 10:47:45,258 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-01-20 10:47:45,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:47:45,258 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-01-20 10:47:45,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:47:45,258 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-01-20 10:47:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:47:45,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:47:45,259 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:47:45,259 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:47:45,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:47:45,260 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-01-20 10:47:45,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:47:45,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:47:45,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:47:45,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:47:45,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:47:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:47:45,472 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-01-20 10:47:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-20 10:47:45,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:47:45,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:47:45,531 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:47:45,532 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-01-20 10:47:45,533 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:47:45,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:47:45,814 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:47:45,815 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:47:45,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:47:45,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:47:45,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:47:45,815 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:47:45,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:47:45,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:47:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:47:45,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:47:45,834 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 18 treesize of output 21 [2019-01-20 10:47:45,842 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 21 treesize of output 23 [2019-01-20 10:47:45,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:45,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:45,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:47:45,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:45,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:45,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:45,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:47:45,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:45,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:45,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:45,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:45,884 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 27 treesize of output 62 [2019-01-20 10:47:45,884 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:45,911 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:45,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:45,937 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:45,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:45,970 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 43 treesize of output 39 [2019-01-20 10:47:45,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:45,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:45,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 36 treesize of output 49 [2019-01-20 10:47:46,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:47:46,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:47:46,071 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:46,086 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:46,101 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:46,117 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:46,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:46,146 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:47:46,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:47:46,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:47:46,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:47:46,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-20 10:47:46,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,349 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:47:46,350 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 49 treesize of output 62 [2019-01-20 10:47:46,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:46,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,414 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:47:46,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2019-01-20 10:47:46,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:46,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:47:46,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-01-20 10:47:46,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 82 [2019-01-20 10:47:46,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:46,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,572 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:47:46,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-20 10:47:46,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:46,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:47:46,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-01-20 10:47:46,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 102 [2019-01-20 10:47:46,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:46,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:46,730 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 45 treesize of output 71 [2019-01-20 10:47:46,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:46,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:47:46,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-20 10:47:46,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:47:46,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:47:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:47:46,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:47:46,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:47:46,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:47:46,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:47:46,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:47:46,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:47:46,890 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-01-20 10:47:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:47:59,341 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-01-20 10:47:59,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:47:59,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-20 10:47:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:47:59,343 INFO L225 Difference]: With dead ends: 441 [2019-01-20 10:47:59,343 INFO L226 Difference]: Without dead ends: 428 [2019-01-20 10:47:59,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:47:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-01-20 10:48:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-01-20 10:48:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-20 10:48:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-01-20 10:48:09,620 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-01-20 10:48:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:48:09,620 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-01-20 10:48:09,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:48:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-01-20 10:48:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:48:09,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:48:09,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:48:09,621 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:48:09,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:48:09,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-01-20 10:48:09,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:48:09,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:48:09,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:48:09,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:48:09,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:48:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:48:09,906 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-20 10:48:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-20 10:48:09,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:48:09,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:48:09,984 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:48:09,984 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-20 10:48:09,985 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:48:09,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:48:10,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:48:10,330 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:48:10,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:48:10,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:48:10,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:48:10,331 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:48:10,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:48:10,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:48:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:48:10,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:48:10,348 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 18 treesize of output 21 [2019-01-20 10:48:10,352 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 21 treesize of output 23 [2019-01-20 10:48:10,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:48:10,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:48:10,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,393 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 27 treesize of output 62 [2019-01-20 10:48:10,393 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:10,418 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:10,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:10,443 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:10,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:10,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:48:10,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,492 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 36 treesize of output 49 [2019-01-20 10:48:10,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:48:10,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:48:10,575 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:10,590 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:10,604 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:10,620 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:10,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:48:10,649 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:48:10,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:48:10,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:48:10,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:48:10,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-20 10:48:10,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,866 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 49 treesize of output 67 [2019-01-20 10:48:10,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:10,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:10,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 96 [2019-01-20 10:48:10,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:10,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:48:10,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-01-20 10:48:11,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,039 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:48:11,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-01-20 10:48:11,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:11,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,105 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:48:11,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-20 10:48:11,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:11,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:48:11,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-01-20 10:48:11,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,199 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:48:11,200 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 39 treesize of output 83 [2019-01-20 10:48:11,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:11,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:11,265 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:48:11,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 106 [2019-01-20 10:48:11,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:11,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:48:11,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-01-20 10:48:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:48:11,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:48:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:48:11,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:48:11,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:48:11,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:48:11,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:48:11,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:48:11,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:48:11,450 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-01-20 10:48:19,047 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-01-20 10:48:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:48:31,701 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-01-20 10:48:31,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:48:31,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:48:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:48:31,703 INFO L225 Difference]: With dead ends: 685 [2019-01-20 10:48:31,703 INFO L226 Difference]: Without dead ends: 677 [2019-01-20 10:48:31,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:48:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-01-20 10:48:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-01-20 10:48:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-01-20 10:48:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-01-20 10:48:47,160 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-01-20 10:48:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:48:47,160 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-01-20 10:48:47,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:48:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-01-20 10:48:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:48:47,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:48:47,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:48:47,162 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:48:47,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:48:47,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-01-20 10:48:47,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:48:47,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:48:47,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:48:47,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:48:47,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:48:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:48:47,515 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-01-20 10:48:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:48:47,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:48:47,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:48:47,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:48:47,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:48:47,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:48:47,611 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:48:47,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:48:47,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:48:47,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:48:47,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:48:47,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:48:47,644 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 43 treesize of output 39 [2019-01-20 10:48:47,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:47,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:47,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:48:47,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:47,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:47,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:47,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:47,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:48:47,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:47,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:47,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:47,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:47,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:47,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:47,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:48:47,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:47,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:47,783 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:47,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:47,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:48:47,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:48:47,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:48:47,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:48:47,833 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 27 treesize of output 62 [2019-01-20 10:48:47,833 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:47,856 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:47,869 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:47,879 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:47,889 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:47,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:48:47,917 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:48:47,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:47,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:48:47,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:48:48,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:48:48,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-20 10:48:48,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-20 10:48:48,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:48,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,589 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:48:48,589 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 45 treesize of output 51 [2019-01-20 10:48:48,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:48,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:48:48,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-01-20 10:48:48,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,702 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:48:48,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-01-20 10:48:48,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:48,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,771 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 55 treesize of output 45 [2019-01-20 10:48:48,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:48,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:48:48,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-01-20 10:48:49,189 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-20 10:48:49,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,199 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 45 treesize of output 59 [2019-01-20 10:48:49,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:49,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,256 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:48:49,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 110 [2019-01-20 10:48:49,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:49,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:48:49,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-20 10:48:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:48:49,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:48:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:48:49,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:48:49,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-20 10:48:49,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:48:49,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:48:49,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:48:49,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:48:49,445 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-01-20 10:49:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:49:04,432 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-01-20 10:49:04,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:49:04,433 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-20 10:49:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:49:04,434 INFO L225 Difference]: With dead ends: 550 [2019-01-20 10:49:04,434 INFO L226 Difference]: Without dead ends: 543 [2019-01-20 10:49:04,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:49:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-01-20 10:49:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-01-20 10:49:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:49:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-20 10:49:07,462 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-01-20 10:49:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:49:07,462 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-20 10:49:07,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:49:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-20 10:49:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:49:07,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:49:07,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:49:07,463 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:49:07,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:49:07,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-01-20 10:49:07,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:49:07,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:49:07,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:49:07,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:49:07,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:49:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:49:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:49:07,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:49:07,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:49:07,555 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-20 10:49:07,555 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-20 10:49:07,556 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:49:07,556 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:49:07,936 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:49:07,936 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:49:07,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:49:07,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:49:07,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:49:07,937 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:49:07,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:49:07,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:49:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:49:07,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:49:07,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:07,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:49:08,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:08,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:08,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:49:08,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:08,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:08,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:08,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:08,061 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:49:08,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:08,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:08,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:08,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:08,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:08,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:08,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:49:08,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:08,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:08,145 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:08,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:08,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:49:08,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:49:08,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:49:08,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:49:08,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:49:08,221 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:08,588 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:08,804 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:08,950 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:09,077 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:09,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:09,441 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:49:09,832 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-20 10:49:09,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:09,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:49:09,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:09,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:09,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:49:09,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:09,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:09,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:09,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:09,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:09,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:09,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:09,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:49:09,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:10,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:10,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-20 10:49:10,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,054 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:49:10,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:49:10,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:10,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:10,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-20 10:49:10,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:10,133 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:49:10,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-20 10:49:10,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:10,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:10,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:49:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:49:10,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:49:10,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:49:10,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:49:10,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-20 10:49:10,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:49:10,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:49:10,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:49:10,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:49:10,706 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-20 10:49:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:49:16,732 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-01-20 10:49:16,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:49:16,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-20 10:49:16,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:49:16,733 INFO L225 Difference]: With dead ends: 67 [2019-01-20 10:49:16,733 INFO L226 Difference]: Without dead ends: 58 [2019-01-20 10:49:16,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:49:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-20 10:49:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-01-20 10:49:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 10:49:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-01-20 10:49:19,996 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-01-20 10:49:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:49:19,996 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-01-20 10:49:19,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:49:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-01-20 10:49:19,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:49:19,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:49:19,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:49:19,997 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:49:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:49:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-01-20 10:49:19,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:49:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:49:19,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:49:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:49:19,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:49:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:49:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-20 10:49:20,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:49:20,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:49:20,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-20 10:49:20,149 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-20 10:49:20,150 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:49:20,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:49:20,487 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:49:20,487 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:49:20,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:49:20,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:49:20,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:49:20,487 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:49:20,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:49:20,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:49:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:49:20,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:49:20,509 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 43 treesize of output 39 [2019-01-20 10:49:20,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,536 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 36 treesize of output 49 [2019-01-20 10:49:20,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:49:20,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:49:20,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:20,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:20,655 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:20,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:20,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:49:20,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:49:20,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:49:20,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:49:20,705 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 27 treesize of output 62 [2019-01-20 10:49:20,705 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:20,727 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:20,740 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:20,750 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:20,760 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:20,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:20,788 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-20 10:49:20,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:49:20,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:20,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:20,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-20 10:49:20,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:20,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:49:20,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:49:21,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:49:21,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-01-20 10:49:21,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,061 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:49:21,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-20 10:49:21,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:21,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,123 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:49:21,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 104 [2019-01-20 10:49:21,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:21,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:49:21,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-01-20 10:49:21,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,235 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:49:21,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 109 [2019-01-20 10:49:21,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:21,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:21,308 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:49:21,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-20 10:49:21,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:21,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:49:21,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-01-20 10:49:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:49:21,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:49:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:49:21,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:49:21,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:49:21,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:49:21,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:49:21,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:49:21,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:49:21,489 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-01-20 10:49:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:49:27,841 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-01-20 10:49:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:49:27,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-20 10:49:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:49:27,842 INFO L225 Difference]: With dead ends: 74 [2019-01-20 10:49:27,843 INFO L226 Difference]: Without dead ends: 59 [2019-01-20 10:49:27,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:49:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-20 10:49:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-01-20 10:49:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:49:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-20 10:49:31,379 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-01-20 10:49:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:49:31,379 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-20 10:49:31,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:49:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-20 10:49:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:49:31,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:49:31,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:49:31,379 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:49:31,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:49:31,380 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-01-20 10:49:31,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:49:31,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:49:31,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:49:31,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:49:31,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:49:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:49:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:49:31,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:49:31,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:49:31,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-20 10:49:31,537 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-01-20 10:49:31,537 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:49:31,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:49:31,900 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:49:31,900 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:49:31,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:49:31,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:49:31,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:49:31,901 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:49:31,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:49:31,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:49:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:49:31,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:49:31,916 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 43 treesize of output 39 [2019-01-20 10:49:31,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:31,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:31,933 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 36 treesize of output 49 [2019-01-20 10:49:31,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:31,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:31,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:31,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:31,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:49:32,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:49:32,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:32,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:32,052 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:32,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:32,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:49:32,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:49:32,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:49:32,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:49:32,104 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 27 treesize of output 62 [2019-01-20 10:49:32,104 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:32,125 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:32,136 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:32,146 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:32,156 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:32,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:32,184 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:49:32,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:49:32,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:32,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. [2019-01-20 10:49:32,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:49:32,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:49:32,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:32,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:32,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-20 10:49:32,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,325 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:49:32,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-20 10:49:32,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:32,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:32,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:49:32,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:32,380 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:49:32,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-20 10:49:32,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:32,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:32,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-20 10:49:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:49:32,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:49:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:49:32,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:49:32,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-20 10:49:32,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:49:32,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:49:32,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:49:32,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:49:32,552 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-20 10:49:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:49:39,919 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-01-20 10:49:39,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:49:39,920 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-20 10:49:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:49:39,920 INFO L225 Difference]: With dead ends: 80 [2019-01-20 10:49:39,921 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:49:39,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:49:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:49:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-01-20 10:49:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-20 10:49:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-01-20 10:49:46,299 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-01-20 10:49:46,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:49:46,299 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-01-20 10:49:46,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:49:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-01-20 10:49:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-20 10:49:46,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:49:46,300 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:49:46,300 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:49:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:49:46,300 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-01-20 10:49:46,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:49:46,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:49:46,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:49:46,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:49:46,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:49:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:49:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-20 10:49:46,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:49:46,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:49:46,415 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:49:46,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:49:46,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:49:46,415 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:49:46,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:49:46,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:49:46,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:49:46,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:49:46,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:49:46,441 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 18 treesize of output 21 [2019-01-20 10:49:46,443 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 21 treesize of output 23 [2019-01-20 10:49:46,450 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 23 treesize of output 25 [2019-01-20 10:49:46,460 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-20 10:49:46,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:49:46,472 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,489 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,509 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,534 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 17 treesize of output 20 [2019-01-20 10:49:46,537 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 20 treesize of output 22 [2019-01-20 10:49:46,541 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 22 treesize of output 24 [2019-01-20 10:49:46,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-20 10:49:46,561 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,569 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,576 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,583 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:46,600 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-01-20 10:49:46,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:49:46,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:49:46,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-20 10:49:46,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-20 10:49:46,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,692 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 26 treesize of output 32 [2019-01-20 10:49:46,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-01-20 10:49:46,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-20 10:49:46,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-01-20 10:49:46,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-20 10:49:46,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,816 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 [2019-01-20 10:49:46,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-20 10:49:46,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-01-20 10:49:46,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,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, 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 [2019-01-20 10:49:46,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-20 10:49:46,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-20 10:49:46,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-01-20 10:49:46,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,956 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:49:46,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,957 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 55 [2019-01-20 10:49:46,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:46,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:46,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-20 10:49:46,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:47,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:49:47,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-01-20 10:49:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:49:47,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:49:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:49:47,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:49:47,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-20 10:49:47,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:49:47,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:49:47,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:49:47,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:49:47,129 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-01-20 10:49:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:49:54,086 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-01-20 10:49:54,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:49:54,087 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-01-20 10:49:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:49:54,087 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:49:54,087 INFO L226 Difference]: Without dead ends: 0 [2019-01-20 10:49:54,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:49:54,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-20 10:49:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-20 10:49:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-20 10:49:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-20 10:49:54,088 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-20 10:49:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:49:54,089 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-20 10:49:54,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:49:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-20 10:49:54,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-20 10:49:54,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-20 10:49:54,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:49:54,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:49:55,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:49:58,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:50:06,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:50:06,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:50:06,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:50:06,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:50:07,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:50:07,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:50:26,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:50:27,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:50:52,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:51:03,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:51:04,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:51:06,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:51:07,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:51:13,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:51:19,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:51:23,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:51:40,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:51:40,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent.