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-7-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:54:09,077 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:54:09,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:54:09,099 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:54:09,100 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:54:09,102 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:54:09,104 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:54:09,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:54:09,109 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:54:09,110 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:54:09,112 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:54:09,113 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:54:09,114 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:54:09,115 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:54:09,116 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:54:09,117 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:54:09,118 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:54:09,120 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:54:09,123 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:54:09,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:54:09,126 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:54:09,127 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:54:09,130 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:54:09,131 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:54:09,131 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:54:09,132 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:54:09,133 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:54:09,134 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:54:09,135 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:54:09,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:54:09,137 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:54:09,138 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:54:09,138 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:54:09,138 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:54:09,139 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:54:09,140 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:54:09,141 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-02-28 10:54:09,157 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:54:09,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:54:09,159 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:54:09,159 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:54:09,159 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:54:09,159 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:54:09,159 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:54:09,160 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:54:09,162 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:54:09,162 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:54:09,162 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:54:09,162 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:54:09,163 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:54:09,166 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:54:09,166 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:54:09,166 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:54:09,166 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:54:09,167 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:54:09,167 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:54:09,167 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:54:09,167 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:54:09,167 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:54:09,168 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:54:09,168 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:54:09,168 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:54:09,168 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:54:09,168 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:54:09,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:54:09,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:54:09,171 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:54:09,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:54:09,172 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:54:09,172 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:54:09,172 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:54:09,172 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:54:09,172 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:54:09,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:54:09,173 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:54:09,173 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:54:09,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:54:09,256 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:54:09,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:54:09,266 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:54:09,267 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:54:09,268 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl [2019-02-28 10:54:09,269 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl' [2019-02-28 10:54:09,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:54:09,333 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:54:09,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:54:09,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:54:09,335 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:54:09,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:54:09" (1/1) ... [2019-02-28 10:54:09,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:54:09" (1/1) ... [2019-02-28 10:54:09,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:54:09,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:54:09,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:54:09,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:54:09,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:54:09" (1/1) ... [2019-02-28 10:54:09,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:54:09" (1/1) ... [2019-02-28 10:54:09,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:54:09" (1/1) ... [2019-02-28 10:54:09,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:54:09" (1/1) ... [2019-02-28 10:54:09,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:54:09" (1/1) ... [2019-02-28 10:54:09,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:54:09" (1/1) ... [2019-02-28 10:54:09,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:54:09" (1/1) ... [2019-02-28 10:54:09,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:54:09,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:54:09,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:54:09,487 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:54:09,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:54:09" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:54:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:54:09,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:54:10,086 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:54:10,087 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-02-28 10:54:10,090 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:54:10 BoogieIcfgContainer [2019-02-28 10:54:10,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:54:10,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:54:10,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:54:10,099 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:54:10,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:54:09" (1/2) ... [2019-02-28 10:54:10,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113f90ef and model type speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:54:10, skipping insertion in model container [2019-02-28 10:54:10,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:54:10" (2/2) ... [2019-02-28 10:54:10,105 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-unlimited.bpl [2019-02-28 10:54:10,121 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:54:10,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-02-28 10:54:10,161 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-02-28 10:54:10,207 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:54:10,208 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:54:10,208 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:54:10,208 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:54:10,208 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:54:10,209 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:54:10,209 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:54:10,209 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:54:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-02-28 10:54:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 10:54:10,241 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:10,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 10:54:10,246 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:10,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:10,254 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-02-28 10:54:10,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:10,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:10,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:10,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:10,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:10,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:54:10,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:54:10,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:54:10,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:54:10,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:54:10,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:54:10,519 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-02-28 10:54:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:10,835 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-02-28 10:54:10,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:54:10,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 10:54:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:10,856 INFO L225 Difference]: With dead ends: 33 [2019-02-28 10:54:10,857 INFO L226 Difference]: Without dead ends: 28 [2019-02-28 10:54:10,861 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-02-28 10:54:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-28 10:54:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-02-28 10:54:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:54:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-02-28 10:54:10,902 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-02-28 10:54:10,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:10,904 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-02-28 10:54:10,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:54:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-02-28 10:54:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:54:10,906 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:10,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:54:10,907 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:10,908 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-02-28 10:54:10,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:10,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:10,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:10,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:11,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:54:11,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:54:11,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:54:11,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:54:11,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:54:11,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:54:11,015 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-02-28 10:54:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:11,303 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-28 10:54:11,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:54:11,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:54:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:11,308 INFO L225 Difference]: With dead ends: 28 [2019-02-28 10:54:11,308 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 10:54:11,311 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-02-28 10:54:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 10:54:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-02-28 10:54:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:54:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-02-28 10:54:11,321 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-02-28 10:54:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:11,321 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-02-28 10:54:11,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:54:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-02-28 10:54:11,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:54:11,322 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:11,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:54:11,324 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:11,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:11,324 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-02-28 10:54:11,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:11,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:11,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:11,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:11,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:11,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:11,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:11,512 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:54:11,514 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-02-28 10:54:11,582 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:54:11,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:54:12,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:54:12,873 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-02-28 10:54:12,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:12,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:54:12,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:12,882 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-02-28 10:54:12,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:12,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:54:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:12,930 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:54:12,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:13,224 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:54:13,225 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:13,240 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:13,274 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:13,393 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:13,492 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:13,586 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:13,689 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-28 10:54:13,701 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:54:13,717 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-02-28 10:54:13,735 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:54:13,749 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:54:13,766 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:54:14,245 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:54:14,248 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:14,392 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:14,560 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:14,645 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:14,662 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:14,680 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:14,696 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:14,753 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:14,754 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-28 10:54:14,835 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:54:14,836 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:14,975 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:14,976 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-02-28 10:54:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:15,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:15,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:54:15,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:54:15,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:54:15,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:54:15,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:54:15,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:54:15,072 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-02-28 10:54:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:15,587 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-02-28 10:54:15,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:54:15,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:54:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:15,592 INFO L225 Difference]: With dead ends: 54 [2019-02-28 10:54:15,592 INFO L226 Difference]: Without dead ends: 52 [2019-02-28 10:54:15,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:54:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-28 10:54:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-02-28 10:54:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 10:54:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-02-28 10:54:15,599 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-02-28 10:54:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:15,600 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-02-28 10:54:15,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:54:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-02-28 10:54:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:54:15,600 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:15,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:54:15,601 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:15,601 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-02-28 10:54:15,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:15,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:15,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:15,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:15,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:15,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:15,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:15,687 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:54:15,687 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-02-28 10:54:15,691 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:54:15,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:54:16,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:54:16,124 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-02-28 10:54:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:16,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:54:16,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:16,125 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-02-28 10:54:16,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:16,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:54:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:16,157 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:54:16,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:16,177 INFO L442 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 24 treesize of output 27 [2019-02-28 10:54:16,216 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,217 INFO L442 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 27 treesize of output 29 [2019-02-28 10:54:16,257 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,282 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,307 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,309 INFO L442 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 29 treesize of output 31 [2019-02-28 10:54:16,338 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,353 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,374 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,399 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,424 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,440 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,440 INFO L289 Elim1Store]: Index analysis took 117 ms [2019-02-28 10:54:16,441 INFO L442 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 31 treesize of output 33 [2019-02-28 10:54:16,468 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,496 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,517 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,542 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,567 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,585 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,606 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,657 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,686 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,686 INFO L289 Elim1Store]: Index analysis took 234 ms [2019-02-28 10:54:16,688 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:54:16,723 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,750 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,769 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,774 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,776 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,777 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,777 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,778 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,780 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,781 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,782 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,784 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,785 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,786 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,788 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,792 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:54:16,810 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,813 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,814 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,817 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,818 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,819 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,821 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,823 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,824 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,826 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,831 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,832 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:16,887 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:54:16,889 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:16,923 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:16,942 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:16,981 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:16,997 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:17,013 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:17,043 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:17,147 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:54:17,148 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:17,159 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:17,175 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:17,188 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:17,206 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:17,541 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:17,593 INFO L315 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:17,593 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:95, output treesize:96 [2019-02-28 10:54:17,655 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:54:17,656 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:17,724 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:17,725 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-28 10:54:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:17,737 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:17,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:54:17,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-28 10:54:17,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:54:17,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:54:17,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:54:17,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:54:17,766 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-02-28 10:54:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:17,842 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-02-28 10:54:17,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:54:17,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 10:54:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:17,843 INFO L225 Difference]: With dead ends: 25 [2019-02-28 10:54:17,844 INFO L226 Difference]: Without dead ends: 24 [2019-02-28 10:54:17,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:54:17,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-28 10:54:17,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-28 10:54:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-28 10:54:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-28 10:54:17,850 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-02-28 10:54:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:17,851 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-28 10:54:17,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:54:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-28 10:54:17,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:54:17,851 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:17,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:54:17,852 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:17,852 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-02-28 10:54:17,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:17,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:17,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:17,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:17,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:17,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:17,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:17,954 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:54:17,954 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-02-28 10:54:17,957 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:54:17,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:54:18,322 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:54:18,323 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-02-28 10:54:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:18,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:54:18,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:18,323 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-02-28 10:54:18,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:18,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:54:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:18,367 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:54:18,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:18,391 INFO L442 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 24 treesize of output 27 [2019-02-28 10:54:18,397 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,398 INFO L442 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 27 treesize of output 29 [2019-02-28 10:54:18,436 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,438 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,441 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,442 INFO L442 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 29 treesize of output 31 [2019-02-28 10:54:18,451 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,453 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,455 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,457 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,457 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,458 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,459 INFO L442 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 31 treesize of output 33 [2019-02-28 10:54:18,464 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,465 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,466 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,467 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,468 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,473 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,474 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,474 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,475 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,480 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,481 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:54:18,484 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,485 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,486 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,487 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,488 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,490 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,491 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,492 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,494 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,495 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,498 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,499 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,500 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,501 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,502 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,503 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:54:18,508 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,509 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,511 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,512 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,513 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,515 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,516 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,526 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,527 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,528 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,529 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,530 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,531 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,533 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,538 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:18,614 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:54:18,616 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:18,633 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:18,648 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:18,665 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:18,680 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:18,694 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:18,711 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:18,808 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:54:18,808 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:18,831 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:18,838 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:18,852 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:18,871 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:18,899 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:18,998 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:18,998 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-28 10:54:19,061 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:54:19,062 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:19,118 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:19,119 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-02-28 10:54:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:19,140 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:19,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:54:19,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:54:19,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:54:19,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:54:19,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:54:19,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:54:19,183 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-02-28 10:54:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:19,532 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-02-28 10:54:19,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:54:19,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:54:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:19,535 INFO L225 Difference]: With dead ends: 57 [2019-02-28 10:54:19,535 INFO L226 Difference]: Without dead ends: 56 [2019-02-28 10:54:19,536 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-02-28 10:54:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-28 10:54:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-02-28 10:54:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-28 10:54:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-02-28 10:54:19,543 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-02-28 10:54:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:19,543 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-02-28 10:54:19,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:54:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-02-28 10:54:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:54:19,544 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:19,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:54:19,544 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:19,545 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-02-28 10:54:19,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:19,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:19,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:19,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:19,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:19,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:19,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:19,593 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:54:19,593 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-02-28 10:54:19,595 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:54:19,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:54:19,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:54:19,899 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-02-28 10:54:19,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:19,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:54:19,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:19,899 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-02-28 10:54:19,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:19,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:54:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:19,934 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:54:19,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:19,954 INFO L442 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 24 treesize of output 27 [2019-02-28 10:54:19,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:19,993 INFO L442 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 27 treesize of output 29 [2019-02-28 10:54:20,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,019 INFO L442 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 29 treesize of output 31 [2019-02-28 10:54:20,027 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,028 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,029 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,030 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,031 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,033 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,034 INFO L442 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 31 treesize of output 33 [2019-02-28 10:54:20,038 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,040 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,042 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,044 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,052 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,054 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,081 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,083 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:54:20,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,101 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,102 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,103 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,105 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,106 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,107 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,108 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,110 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,111 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,112 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,114 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,115 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:54:20,119 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,120 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,121 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,122 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,123 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,125 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,126 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,127 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,129 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,130 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,131 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,134 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,135 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,135 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,136 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:20,178 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:54:20,179 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,194 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,210 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,224 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,241 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,255 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,269 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,381 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:54:20,382 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,388 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,398 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,409 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,427 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,454 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,516 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:20,517 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-28 10:54:20,584 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:54:20,584 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:20,655 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:20,656 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-02-28 10:54:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:20,688 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:20,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-02-28 10:54:20,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:54:20,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:54:20,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:54:20,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:54:20,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:54:20,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:54:20,736 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-02-28 10:54:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:21,090 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-02-28 10:54:21,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:54:21,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:54:21,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:21,093 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:54:21,093 INFO L226 Difference]: Without dead ends: 57 [2019-02-28 10:54:21,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:54:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-28 10:54:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-02-28 10:54:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-28 10:54:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-02-28 10:54:21,107 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-02-28 10:54:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:21,107 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-02-28 10:54:21,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:54:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-02-28 10:54:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:54:21,109 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:21,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:54:21,110 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:21,110 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-02-28 10:54:21,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:21,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:21,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:21,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:54:21,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:54:21,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:54:21,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:54:21,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:54:21,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:54:21,227 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 4 states. [2019-02-28 10:54:21,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:21,333 INFO L93 Difference]: Finished difference Result 37 states and 114 transitions. [2019-02-28 10:54:21,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:54:21,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:54:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:21,335 INFO L225 Difference]: With dead ends: 37 [2019-02-28 10:54:21,335 INFO L226 Difference]: Without dead ends: 36 [2019-02-28 10:54:21,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:54:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-28 10:54:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2019-02-28 10:54:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:54:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 111 transitions. [2019-02-28 10:54:21,344 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 111 transitions. Word has length 4 [2019-02-28 10:54:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:21,344 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 111 transitions. [2019-02-28 10:54:21,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:54:21,345 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 111 transitions. [2019-02-28 10:54:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:54:21,345 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:21,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:54:21,346 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:21,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:21,346 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-02-28 10:54:21,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:21,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:21,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:21,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:21,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:21,505 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-02-28 10:54:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:21,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:21,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:21,530 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:54:21,531 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-02-28 10:54:21,532 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:54:21,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:54:21,857 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:54:21,858 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-02-28 10:54:21,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:21,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:54:21,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:21,858 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-02-28 10:54:21,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:21,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:54:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:21,895 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:54:21,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:22,327 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:54:22,328 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:22,444 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:22,610 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:22,844 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:22,872 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:22,921 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:22,958 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-28 10:54:22,976 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:54:22,992 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-02-28 10:54:23,003 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:54:23,018 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:54:23,029 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:54:23,082 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:54:23,084 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:23,095 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:23,112 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:23,126 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:23,141 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:23,155 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:23,170 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:23,221 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:23,221 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-28 10:54:23,256 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:54:23,256 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:23,299 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:23,300 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-02-28 10:54:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:23,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:23,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:54:23,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-28 10:54:23,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:54:23,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:54:23,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:54:23,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:54:23,350 INFO L87 Difference]: Start difference. First operand 32 states and 111 transitions. Second operand 4 states. [2019-02-28 10:54:23,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:23,403 INFO L93 Difference]: Finished difference Result 36 states and 122 transitions. [2019-02-28 10:54:23,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:54:23,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:54:23,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:23,404 INFO L225 Difference]: With dead ends: 36 [2019-02-28 10:54:23,405 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:54:23,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-02-28 10:54:23,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:54:23,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-28 10:54:23,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-28 10:54:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 121 transitions. [2019-02-28 10:54:23,413 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 121 transitions. Word has length 4 [2019-02-28 10:54:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:23,413 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 121 transitions. [2019-02-28 10:54:23,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:54:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 121 transitions. [2019-02-28 10:54:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:54:23,414 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:23,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:54:23,414 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:23,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:23,414 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-02-28 10:54:23,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:23,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:23,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:23,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:23,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:23,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:23,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:23,517 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:54:23,517 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-02-28 10:54:23,518 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:54:23,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:54:23,931 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:54:23,932 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-02-28 10:54:23,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:23,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:54:23,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:23,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:54:23,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:23,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:54:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:23,972 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:54:23,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:23,976 INFO L442 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 24 treesize of output 27 [2019-02-28 10:54:23,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:23,981 INFO L442 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 27 treesize of output 29 [2019-02-28 10:54:23,983 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:23,985 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:23,987 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:23,988 INFO L442 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 29 treesize of output 31 [2019-02-28 10:54:23,993 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,002 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,008 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,024 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,026 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,027 INFO L442 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 31 treesize of output 33 [2019-02-28 10:54:24,029 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,031 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,033 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,035 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,037 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,039 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,043 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,047 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,048 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:54:24,053 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,055 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,057 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,059 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,067 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,069 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,069 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,085 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,089 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,089 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,090 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,092 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,093 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:54:24,097 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,101 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,103 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,104 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,105 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,106 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,108 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,109 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,110 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,111 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,113 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,114 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:24,157 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:54:24,158 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,173 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,189 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,204 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,218 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,255 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,272 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,332 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:54:24,333 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,339 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,348 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,360 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,380 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,409 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,461 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:24,461 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-28 10:54:24,618 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-28 10:54:24,625 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:54:24,626 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,669 INFO L315 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-02-28 10:54:24,669 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-02-28 10:54:24,767 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-02-28 10:54:24,768 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:24,801 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:24,802 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-28 10:54:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:24,826 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:24,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:54:24,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:54:24,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:54:24,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:54:24,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:54:24,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:54:24,870 INFO L87 Difference]: Start difference. First operand 34 states and 121 transitions. Second operand 8 states. [2019-02-28 10:54:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:25,457 INFO L93 Difference]: Finished difference Result 79 states and 193 transitions. [2019-02-28 10:54:25,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:54:25,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:54:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:25,459 INFO L225 Difference]: With dead ends: 79 [2019-02-28 10:54:25,460 INFO L226 Difference]: Without dead ends: 77 [2019-02-28 10:54:25,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:54:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-28 10:54:25,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2019-02-28 10:54:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:54:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-28 10:54:25,470 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-02-28 10:54:25,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:25,470 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-28 10:54:25,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:54:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-28 10:54:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:54:25,471 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:25,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:54:25,471 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:25,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:25,472 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-02-28 10:54:25,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:25,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:25,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:25,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:25,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:25,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:25,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:25,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:54:25,566 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-02-28 10:54:25,568 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:54:25,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:54:25,942 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:54:25,942 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-02-28 10:54:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:25,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:54:25,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:25,943 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-02-28 10:54:25,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:25,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:54:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:25,979 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:54:25,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:25,999 INFO L442 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 24 treesize of output 27 [2019-02-28 10:54:26,038 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,039 INFO L442 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 27 treesize of output 29 [2019-02-28 10:54:26,053 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,055 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,057 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,057 INFO L442 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 29 treesize of output 31 [2019-02-28 10:54:26,060 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,062 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,064 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,066 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,068 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,071 INFO L442 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 31 treesize of output 33 [2019-02-28 10:54:26,076 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,084 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,085 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,094 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,095 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:54:26,099 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,102 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,104 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,104 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,105 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,106 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,107 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,108 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,109 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,111 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,112 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,113 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,114 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,116 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,117 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,118 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:54:26,122 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,123 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,124 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,124 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,126 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,127 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,128 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,129 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,130 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,132 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,133 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,134 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,135 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,137 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,138 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:26,182 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:54:26,183 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,198 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,226 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,246 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,262 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,277 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,292 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,351 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:54:26,352 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,357 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,368 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,383 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,405 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,443 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,492 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:26,492 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-28 10:54:26,581 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:54:26,582 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,628 INFO L315 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-02-28 10:54:26,629 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-02-28 10:54:26,670 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-02-28 10:54:26,671 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:26,703 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:26,704 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-02-28 10:54:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:26,723 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:26,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:54:26,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:54:26,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:54:26,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:54:26,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:54:26,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:54:26,777 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-02-28 10:54:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:27,219 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-02-28 10:54:27,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:54:27,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:54:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:27,221 INFO L225 Difference]: With dead ends: 74 [2019-02-28 10:54:27,221 INFO L226 Difference]: Without dead ends: 73 [2019-02-28 10:54:27,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:54:27,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-28 10:54:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2019-02-28 10:54:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:54:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-28 10:54:27,231 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-02-28 10:54:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:27,231 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-28 10:54:27,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:54:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-28 10:54:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:54:27,232 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:27,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:54:27,233 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:27,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:27,233 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-02-28 10:54:27,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:27,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:27,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:27,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:27,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:27,394 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-02-28 10:54:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:27,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:27,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:27,406 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:54:27,407 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-02-28 10:54:27,408 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:54:27,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:54:27,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:54:27,790 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-02-28 10:54:27,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:27,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:54:27,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:27,790 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-02-28 10:54:27,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:27,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:54:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:27,827 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:54:27,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:28,107 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:54:28,108 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,115 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,131 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,149 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,182 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,211 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,247 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-28 10:54:28,251 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-02-28 10:54:28,253 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-02-28 10:54:28,258 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:54:28,265 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:54:28,271 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:54:28,320 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:54:28,321 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,333 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,347 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,360 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,375 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,389 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,403 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,452 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:28,452 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-28 10:54:28,509 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 10:54:28,510 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,553 INFO L315 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-02-28 10:54:28,553 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-02-28 10:54:28,610 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-02-28 10:54:28,611 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:28,644 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:28,644 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-02-28 10:54:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:28,664 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:54:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:28,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:54:28,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:54:28,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:54:28,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:54:28,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:54:28,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:54:28,709 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-02-28 10:54:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:54:29,248 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-02-28 10:54:29,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:54:29,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:54:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:54:29,249 INFO L225 Difference]: With dead ends: 74 [2019-02-28 10:54:29,249 INFO L226 Difference]: Without dead ends: 72 [2019-02-28 10:54:29,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:54:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-28 10:54:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2019-02-28 10:54:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-28 10:54:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 149 transitions. [2019-02-28 10:54:29,258 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 149 transitions. Word has length 4 [2019-02-28 10:54:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:54:29,258 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 149 transitions. [2019-02-28 10:54:29,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:54:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 149 transitions. [2019-02-28 10:54:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:54:29,259 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:54:29,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:54:29,260 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:54:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:29,260 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-02-28 10:54:29,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:54:29,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:29,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:29,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:54:29,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:54:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:29,429 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-02-28 10:54:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:29,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:29,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:54:29,452 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:54:29,453 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-02-28 10:54:29,454 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:54:29,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:54:29,843 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:54:29,843 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-02-28 10:54:29,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:54:29,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:54:29,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:54:29,843 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-02-28 10:54:29,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:54:29,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:54:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:54:29,858 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:54:29,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:54:29,877 INFO L442 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 24 treesize of output 27 [2019-02-28 10:54:29,884 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:29,885 INFO L442 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 27 treesize of output 29 [2019-02-28 10:54:29,889 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:29,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:29,893 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:29,893 INFO L442 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 29 treesize of output 31 [2019-02-28 10:54:29,902 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:29,905 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:29,907 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:29,909 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:29,910 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:29,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:29,912 INFO L442 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 31 treesize of output 33 [2019-02-28 10:54:29,954 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:29,976 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,001 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,022 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,051 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,064 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,111 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,134 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,156 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,156 INFO L289 Elim1Store]: Index analysis took 224 ms [2019-02-28 10:54:30,158 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:54:30,193 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,218 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,268 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,317 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,343 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,370 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,391 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,416 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,441 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,462 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,479 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,481 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,484 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,485 INFO L289 Elim1Store]: Index analysis took 316 ms [2019-02-28 10:54:30,485 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-02-28 10:54:30,503 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,504 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,504 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,505 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,506 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,507 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,508 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,509 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,511 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,512 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,513 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,514 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,516 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,517 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,518 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:54:30,561 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-02-28 10:54:30,562 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:30,577 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:30,593 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:30,610 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:30,624 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:30,638 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:30,654 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:30,742 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 10:54:30,743 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:30,771 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:30,776 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:30,791 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:30,811 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:30,855 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:54:30,911 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 10:54:30,911 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-28 10:54:31,020 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-02-28 10:54:31,021 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-28 10:54:31,112 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-28 10:54:31,112 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:152 [2019-02-28 10:54:31,304 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-02-28 10:54:31,394 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 113 [2019-02-28 10:54:31,396 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:54:31,561 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 88 treesize of output 121 [2019-02-28 10:54:31,574 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 32 xjuncts. [2019-02-28 10:54:32,059 INFO L315 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-02-28 10:54:32,060 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:487 [2019-02-28 10:57:46,543 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:57:46,545 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 57495 column 7: Overflow encountered when expanding vector at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.push(DiffWrapperScript.java:93) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.push(WrapperScript.java:101) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UndoableWrapperScript.push(UndoableWrapperScript.java:52) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-02-28 10:57:46,549 INFO L168 Benchmark]: Toolchain (without parser) took 217217.00 ms. Allocated memory was 138.9 MB in the beginning and 491.3 MB in the end (delta: 352.3 MB). Free memory was 105.1 MB in the beginning and 168.5 MB in the end (delta: -63.4 MB). Peak memory consumption was 288.9 MB. Max. memory is 7.1 GB. [2019-02-28 10:57:46,550 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:57:46,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.37 ms. Allocated memory is still 138.9 MB. Free memory was 104.7 MB in the beginning and 102.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-28 10:57:46,551 INFO L168 Benchmark]: Boogie Preprocessor took 57.72 ms. Allocated memory is still 138.9 MB. Free memory was 102.6 MB in the beginning and 101.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-28 10:57:46,551 INFO L168 Benchmark]: RCFGBuilder took 604.29 ms. Allocated memory is still 138.9 MB. Free memory was 101.3 MB in the beginning and 88.8 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2019-02-28 10:57:46,552 INFO L168 Benchmark]: TraceAbstraction took 216455.98 ms. Allocated memory was 138.9 MB in the beginning and 491.3 MB in the end (delta: 352.3 MB). Free memory was 88.8 MB in the beginning and 168.5 MB in the end (delta: -79.8 MB). Peak memory consumption was 272.6 MB. Max. memory is 7.1 GB. [2019-02-28 10:57:46,555 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 89.37 ms. Allocated memory is still 138.9 MB. Free memory was 104.7 MB in the beginning and 102.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.72 ms. Allocated memory is still 138.9 MB. Free memory was 102.6 MB in the beginning and 101.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 604.29 ms. Allocated memory is still 138.9 MB. Free memory was 101.3 MB in the beginning and 88.8 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 216455.98 ms. Allocated memory was 138.9 MB in the beginning and 491.3 MB in the end (delta: 352.3 MB). Free memory was 88.8 MB in the beginning and 168.5 MB in the end (delta: -79.8 MB). Peak memory consumption was 272.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 57495 column 7: Overflow encountered when expanding vector de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 57495 column 7: Overflow encountered when expanding vector: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1420) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...