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-8-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:55:24,306 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:55:24,311 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:55:24,328 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:55:24,328 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:55:24,329 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:55:24,331 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:55:24,332 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:55:24,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:55:24,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:55:24,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:55:24,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:55:24,337 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:55:24,338 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:55:24,339 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:55:24,340 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:55:24,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:55:24,342 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:55:24,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:55:24,346 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:55:24,347 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:55:24,349 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:55:24,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:55:24,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:55:24,351 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:55:24,352 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:55:24,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:55:24,354 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:55:24,355 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:55:24,356 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:55:24,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:55:24,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:55:24,358 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:55:24,358 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:55:24,359 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:55:24,360 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:55:24,360 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-03-04 16:55:24,376 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:55:24,378 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:55:24,379 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:55:24,379 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:55:24,380 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:55:24,380 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:55:24,380 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:55:24,380 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:55:24,381 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:55:24,381 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:55:24,381 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:55:24,381 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:55:24,381 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:55:24,382 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:55:24,382 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:55:24,382 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:55:24,383 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:55:24,384 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:55:24,384 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:55:24,384 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:55:24,384 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:55:24,384 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:55:24,385 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:55:24,385 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:55:24,385 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:55:24,386 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:55:24,386 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:55:24,386 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:55:24,386 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:55:24,386 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:55:24,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:55:24,388 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:55:24,388 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:55:24,388 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:55:24,388 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:55:24,388 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:55:24,388 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:55:24,389 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:55:24,389 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:55:24,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:55:24,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:55:24,459 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:55:24,462 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:55:24,462 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:55:24,463 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl [2019-03-04 16:55:24,464 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl' [2019-03-04 16:55:24,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:55:24,513 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:55:24,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:55:24,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:55:24,514 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:55:24,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:55:24" (1/1) ... [2019-03-04 16:55:24,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:55:24" (1/1) ... [2019-03-04 16:55:24,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:55:24,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:55:24,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:55:24,578 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:55:24,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:55:24" (1/1) ... [2019-03-04 16:55:24,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:55:24" (1/1) ... [2019-03-04 16:55:24,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:55:24" (1/1) ... [2019-03-04 16:55:24,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:55:24" (1/1) ... [2019-03-04 16:55:24,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:55:24" (1/1) ... [2019-03-04 16:55:24,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:55:24" (1/1) ... [2019-03-04 16:55:24,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:55:24" (1/1) ... [2019-03-04 16:55:24,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:55:24,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:55:24,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:55:24,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:55:24,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:55:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:55:24,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:55:24,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:55:25,158 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:55:25,159 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-03-04 16:55:25,160 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:55:25 BoogieIcfgContainer [2019-03-04 16:55:25,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:55:25,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:55:25,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:55:25,166 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:55:25,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:55:24" (1/2) ... [2019-03-04 16:55:25,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a5307b and model type speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:55:25, skipping insertion in model container [2019-03-04 16:55:25,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:55:25" (2/2) ... [2019-03-04 16:55:25,170 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-8-unlimited.bpl [2019-03-04 16:55:25,181 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:55:25,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-03-04 16:55:25,211 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-03-04 16:55:25,255 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:55:25,255 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:55:25,255 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:55:25,256 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:55:25,256 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:55:25,256 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:55:25,256 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:55:25,256 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:55:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-03-04 16:55:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:55:25,280 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:25,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:55:25,283 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-03-04 16:55:25,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:25,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:25,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:25,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:25,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:25,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-03-04 16:55:25,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:55:25,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:55:25,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:25,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:55:25,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:55:25,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:55:25,510 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-03-04 16:55:25,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:25,753 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-03-04 16:55:25,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:55:25,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:55:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:25,770 INFO L225 Difference]: With dead ends: 37 [2019-03-04 16:55:25,771 INFO L226 Difference]: Without dead ends: 32 [2019-03-04 16:55:25,774 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-03-04 16:55:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-03-04 16:55:25,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2019-03-04 16:55:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:55:25,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2019-03-04 16:55:25,811 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 2 [2019-03-04 16:55:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:25,813 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2019-03-04 16:55:25,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:55:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2019-03-04 16:55:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:55:25,814 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:25,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:55:25,815 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:25,815 INFO L82 PathProgramCache]: Analyzing trace with hash 30818, now seen corresponding path program 1 times [2019-03-04 16:55:25,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:25,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:25,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:25,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:25,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:25,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:25,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:25,997 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:55:25,999 INFO L207 CegarAbsIntRunner]: [0], [32], [35] [2019-03-04 16:55:26,056 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:26,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:29,649 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:29,651 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:55:29,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:29,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:29,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:29,659 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-03-04 16:55:29,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:29,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:29,710 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-03-04 16:55:29,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:29,824 INFO L453 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 27 treesize of output 30 [2019-03-04 16:55:29,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:29,889 INFO L453 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 30 treesize of output 32 [2019-03-04 16:55:29,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:29,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:29,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:29,937 INFO L453 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 32 treesize of output 34 [2019-03-04 16:55:29,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:29,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,037 INFO L453 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 34 treesize of output 36 [2019-03-04 16:55:30,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,232 INFO L301 Elim1Store]: Index analysis took 176 ms [2019-03-04 16:55:30,234 INFO L453 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 36 treesize of output 38 [2019-03-04 16:55:30,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,392 INFO L301 Elim1Store]: Index analysis took 130 ms [2019-03-04 16:55:30,394 INFO L453 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 38 treesize of output 40 [2019-03-04 16:55:30,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,560 INFO L301 Elim1Store]: Index analysis took 143 ms [2019-03-04 16:55:30,563 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:55:30,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:30,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:55:30,687 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:30,833 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:30,861 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:31,059 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:31,082 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:31,128 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:31,216 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:31,432 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:31,709 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:55:31,709 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:31,751 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:31,774 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:31,806 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:31,864 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:32,353 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:32,443 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:32,542 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:32,682 INFO L309 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-03-04 16:55:32,683 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:147, output treesize:153 [2019-03-04 16:55:32,754 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:55:32,755 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:33,093 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:33,093 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:127 [2019-03-04 16:55:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:33,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:33,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:33,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:55:33,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:33,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:55:33,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:55:33,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:55:33,188 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 6 states. [2019-03-04 16:55:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:45,161 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2019-03-04 16:55:45,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:55:45,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:55:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:45,163 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:55:45,163 INFO L226 Difference]: Without dead ends: 60 [2019-03-04 16:55:45,164 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-03-04 16:55:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-03-04 16:55:45,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 25. [2019-03-04 16:55:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:55:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 53 transitions. [2019-03-04 16:55:45,172 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 53 transitions. Word has length 3 [2019-03-04 16:55:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:45,172 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 53 transitions. [2019-03-04 16:55:45,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:55:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 53 transitions. [2019-03-04 16:55:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:55:45,173 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:45,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:55:45,174 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:45,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:45,174 INFO L82 PathProgramCache]: Analyzing trace with hash 30384, now seen corresponding path program 1 times [2019-03-04 16:55:45,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:45,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:45,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:45,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:45,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:45,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:45,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:45,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:55:45,290 INFO L207 CegarAbsIntRunner]: [0], [18], [35] [2019-03-04 16:55:45,291 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:45,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:45,599 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:45,599 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-03-04 16:55:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:45,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:45,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:45,600 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-03-04 16:55:45,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:45,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:45,639 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:55:45,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:45,676 INFO L453 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 27 treesize of output 30 [2019-03-04 16:55:45,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,705 INFO L453 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 30 treesize of output 32 [2019-03-04 16:55:45,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,721 INFO L453 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 32 treesize of output 34 [2019-03-04 16:55:45,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,742 INFO L453 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 34 treesize of output 36 [2019-03-04 16:55:45,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,767 INFO L453 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 36 treesize of output 38 [2019-03-04 16:55:45,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,794 INFO L453 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 38 treesize of output 40 [2019-03-04 16:55:45,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,828 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:55:45,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:45,978 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:55:45,980 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:45,999 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,021 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,045 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,062 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,085 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,105 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,127 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,271 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:55:46,272 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,282 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,330 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,350 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,377 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,408 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,465 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,558 INFO L309 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-03-04 16:55:46,559 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-03-04 16:55:46,612 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:55:46,613 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:46,684 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:46,685 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:98 [2019-03-04 16:55:46,857 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-03-04 16:55:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:46,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:46,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:46,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:55:46,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:46,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:55:46,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:55:46,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:55:46,898 INFO L87 Difference]: Start difference. First operand 25 states and 53 transitions. Second operand 6 states. [2019-03-04 16:55:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:47,904 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2019-03-04 16:55:47,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:55:47,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:55:47,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:47,907 INFO L225 Difference]: With dead ends: 62 [2019-03-04 16:55:47,907 INFO L226 Difference]: Without dead ends: 60 [2019-03-04 16:55:47,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:55:47,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-03-04 16:55:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 26. [2019-03-04 16:55:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:55:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 61 transitions. [2019-03-04 16:55:47,915 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 61 transitions. Word has length 3 [2019-03-04 16:55:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:47,915 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 61 transitions. [2019-03-04 16:55:47,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:55:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 61 transitions. [2019-03-04 16:55:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:55:47,915 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:47,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:55:47,916 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:47,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:47,916 INFO L82 PathProgramCache]: Analyzing trace with hash 30944, now seen corresponding path program 1 times [2019-03-04 16:55:47,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:47,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:47,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:47,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:47,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:47,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:55:47,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:55:47,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:47,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:55:47,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:55:47,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:55:47,975 INFO L87 Difference]: Start difference. First operand 26 states and 61 transitions. Second operand 3 states. [2019-03-04 16:55:48,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:48,039 INFO L93 Difference]: Finished difference Result 31 states and 61 transitions. [2019-03-04 16:55:48,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:55:48,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:55:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:48,040 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:55:48,041 INFO L226 Difference]: Without dead ends: 30 [2019-03-04 16:55:48,041 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-03-04 16:55:48,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-03-04 16:55:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-03-04 16:55:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:55:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 60 transitions. [2019-03-04 16:55:48,047 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 60 transitions. Word has length 3 [2019-03-04 16:55:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:48,048 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 60 transitions. [2019-03-04 16:55:48,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:55:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 60 transitions. [2019-03-04 16:55:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:55:48,048 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:48,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:55:48,049 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:48,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:48,049 INFO L82 PathProgramCache]: Analyzing trace with hash 30012, now seen corresponding path program 1 times [2019-03-04 16:55:48,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:48,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:48,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:48,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:48,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:48,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:48,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:48,124 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:55:48,124 INFO L207 CegarAbsIntRunner]: [0], [6], [35] [2019-03-04 16:55:48,128 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:48,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:48,531 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:48,531 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-03-04 16:55:48,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:48,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:48,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:48,532 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-03-04 16:55:48,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:48,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:48,568 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:55:48,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:48,843 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:55:48,844 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,858 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,868 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,881 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,901 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,932 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,978 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,031 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:55:49,036 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:55:49,044 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:55:49,050 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:55:49,055 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:55:49,066 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:55:49,072 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:55:49,133 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:55:49,134 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,152 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,170 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,184 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,201 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,217 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,234 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,251 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,322 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:49,322 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:121, output treesize:125 [2019-03-04 16:55:49,382 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:55:49,383 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,447 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:49,448 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-03-04 16:55:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:49,465 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:49,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:55:49,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:55:49,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:49,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:55:49,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:55:49,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:55:49,489 INFO L87 Difference]: Start difference. First operand 26 states and 60 transitions. Second operand 4 states. [2019-03-04 16:55:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:49,572 INFO L93 Difference]: Finished difference Result 32 states and 98 transitions. [2019-03-04 16:55:49,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:55:49,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:55:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:49,573 INFO L225 Difference]: With dead ends: 32 [2019-03-04 16:55:49,573 INFO L226 Difference]: Without dead ends: 31 [2019-03-04 16:55:49,574 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-03-04 16:55:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-03-04 16:55:49,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-03-04 16:55:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-03-04 16:55:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-03-04 16:55:49,582 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 3 [2019-03-04 16:55:49,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:49,582 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-03-04 16:55:49,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:55:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-03-04 16:55:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:55:49,583 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:49,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:55:49,584 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:49,584 INFO L82 PathProgramCache]: Analyzing trace with hash 30136, now seen corresponding path program 1 times [2019-03-04 16:55:49,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:49,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:49,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:49,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:49,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:49,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:49,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:49,666 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:55:49,667 INFO L207 CegarAbsIntRunner]: [0], [10], [35] [2019-03-04 16:55:49,668 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:49,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:49,979 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:49,980 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-03-04 16:55:49,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:49,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:49,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:49,981 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-03-04 16:55:49,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:49,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:50,018 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:55:50,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:50,030 INFO L453 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 27 treesize of output 30 [2019-03-04 16:55:50,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,070 INFO L453 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 30 treesize of output 32 [2019-03-04 16:55:50,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,083 INFO L453 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 32 treesize of output 34 [2019-03-04 16:55:50,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,107 INFO L453 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 34 treesize of output 36 [2019-03-04 16:55:50,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,128 INFO L453 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 36 treesize of output 38 [2019-03-04 16:55:50,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,157 INFO L453 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 38 treesize of output 40 [2019-03-04 16:55:50,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,190 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:55:50,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:50,311 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:55:50,313 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,330 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,350 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,370 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,389 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,408 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,427 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,446 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,542 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:55:50,542 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,548 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,560 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,581 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,614 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,656 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,701 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,774 INFO L309 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-03-04 16:55:50,774 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-03-04 16:55:50,826 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:55:50,827 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,894 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:50,894 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:98 [2019-03-04 16:55:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:50,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:50,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:50,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:55:50,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:50,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:55:50,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:55:50,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:55:50,945 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 6 states. [2019-03-04 16:55:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:51,944 INFO L93 Difference]: Finished difference Result 65 states and 143 transitions. [2019-03-04 16:55:51,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:55:51,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:55:51,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:51,947 INFO L225 Difference]: With dead ends: 65 [2019-03-04 16:55:51,947 INFO L226 Difference]: Without dead ends: 64 [2019-03-04 16:55:51,947 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-03-04 16:55:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-03-04 16:55:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-03-04 16:55:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-03-04 16:55:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 115 transitions. [2019-03-04 16:55:51,957 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 115 transitions. Word has length 3 [2019-03-04 16:55:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:51,957 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 115 transitions. [2019-03-04 16:55:51,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:55:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 115 transitions. [2019-03-04 16:55:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:55:51,958 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:51,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:55:51,958 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:51,958 INFO L82 PathProgramCache]: Analyzing trace with hash 30632, now seen corresponding path program 1 times [2019-03-04 16:55:51,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:51,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:51,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:51,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:51,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:52,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:52,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:52,094 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:55:52,094 INFO L207 CegarAbsIntRunner]: [0], [26], [35] [2019-03-04 16:55:52,095 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:52,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:52,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:52,383 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-03-04 16:55:52,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:52,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:52,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:52,384 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-03-04 16:55:52,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:52,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:52,420 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:55:52,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:52,428 INFO L453 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 27 treesize of output 30 [2019-03-04 16:55:52,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,437 INFO L453 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 30 treesize of output 32 [2019-03-04 16:55:52,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,450 INFO L453 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 32 treesize of output 34 [2019-03-04 16:55:52,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,471 INFO L453 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 34 treesize of output 36 [2019-03-04 16:55:52,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,496 INFO L453 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 36 treesize of output 38 [2019-03-04 16:55:52,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,529 INFO L453 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 38 treesize of output 40 [2019-03-04 16:55:52,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,562 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:55:52,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,654 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:55:52,655 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:52,714 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:52,734 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:52,751 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:52,771 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:52,791 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:52,810 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:52,830 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:52,944 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:55:52,944 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:52,949 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:52,962 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:52,982 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,004 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,039 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,089 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,174 INFO L309 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-03-04 16:55:53,175 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-03-04 16:55:53,214 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:55:53,214 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,279 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:53,279 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:98 [2019-03-04 16:55:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:53,297 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:53,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:53,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:55:53,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:53,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:55:53,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:55:53,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:55:53,330 INFO L87 Difference]: Start difference. First operand 32 states and 115 transitions. Second operand 6 states. [2019-03-04 16:55:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:54,090 INFO L93 Difference]: Finished difference Result 67 states and 161 transitions. [2019-03-04 16:55:54,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:55:54,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:55:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:54,092 INFO L225 Difference]: With dead ends: 67 [2019-03-04 16:55:54,092 INFO L226 Difference]: Without dead ends: 65 [2019-03-04 16:55:54,092 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-03-04 16:55:54,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-03-04 16:55:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 34. [2019-03-04 16:55:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-03-04 16:55:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 132 transitions. [2019-03-04 16:55:54,102 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 132 transitions. Word has length 3 [2019-03-04 16:55:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:54,103 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 132 transitions. [2019-03-04 16:55:54,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:55:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 132 transitions. [2019-03-04 16:55:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:54,104 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:54,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:54,104 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:54,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:54,104 INFO L82 PathProgramCache]: Analyzing trace with hash 954866, now seen corresponding path program 1 times [2019-03-04 16:55:54,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:54,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:54,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:54,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:54,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:54,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:54,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:54,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:54,238 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [35] [2019-03-04 16:55:54,239 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:54,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:55,041 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:55,041 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:55:55,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:55,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:55,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:55,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:55:55,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:55,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:55,061 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-03-04 16:55:55,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:55,082 INFO L453 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 27 treesize of output 30 [2019-03-04 16:55:55,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,095 INFO L453 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 30 treesize of output 32 [2019-03-04 16:55:55,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,108 INFO L453 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 32 treesize of output 34 [2019-03-04 16:55:55,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,124 INFO L453 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 34 treesize of output 36 [2019-03-04 16:55:55,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,149 INFO L453 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 36 treesize of output 38 [2019-03-04 16:55:55,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,174 INFO L453 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 38 treesize of output 40 [2019-03-04 16:55:55,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,215 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:55:55,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,274 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:55:55,275 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,294 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,312 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,332 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,352 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,371 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,393 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,411 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,513 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:55:55,514 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,520 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,536 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,556 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,586 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,618 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,662 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,727 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,825 INFO L309 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-03-04 16:55:55,826 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-03-04 16:55:55,897 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:55:55,898 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:56,003 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:56,004 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:127 [2019-03-04 16:55:56,117 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:55:56,118 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:56,189 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:56,189 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:109 [2019-03-04 16:55:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:56,213 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:56,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:56,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:55:56,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:56,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:56,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:56,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:55:56,301 INFO L87 Difference]: Start difference. First operand 34 states and 132 transitions. Second operand 8 states. [2019-03-04 16:56:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:02,731 INFO L93 Difference]: Finished difference Result 82 states and 191 transitions. [2019-03-04 16:56:02,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:56:02,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:56:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:02,733 INFO L225 Difference]: With dead ends: 82 [2019-03-04 16:56:02,733 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:56:02,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:56:02,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:56:02,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 36. [2019-03-04 16:56:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:56:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 128 transitions. [2019-03-04 16:56:02,744 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 128 transitions. Word has length 4 [2019-03-04 16:56:02,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:02,744 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 128 transitions. [2019-03-04 16:56:02,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:56:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 128 transitions. [2019-03-04 16:56:02,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:56:02,745 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:02,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:56:02,745 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:02,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:02,746 INFO L82 PathProgramCache]: Analyzing trace with hash 955426, now seen corresponding path program 1 times [2019-03-04 16:56:02,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:02,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:02,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:02,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:02,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:02,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:02,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:02,826 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:56:02,826 INFO L207 CegarAbsIntRunner]: [0], [32], [36], [37] [2019-03-04 16:56:02,826 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:02,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:04,511 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:04,512 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:56:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:04,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:04,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:04,512 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-03-04 16:56:04,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:04,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:04,566 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:56:04,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:05,023 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 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-03-04 16:56:05,024 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,125 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,261 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,294 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,343 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,409 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,597 INFO L453 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 27 treesize of output 30 [2019-03-04 16:56:05,611 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 35 [2019-03-04 16:56:05,623 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:56:05,632 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 17 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:56:05,637 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:56:05,644 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:56:05,650 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:56:05,708 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:56:05,709 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,725 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,739 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,754 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,771 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,788 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,804 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,820 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:05,892 INFO L309 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-03-04 16:56:05,892 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-03-04 16:56:06,065 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 20 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 51 treesize of output 95 [2019-03-04 16:56:06,065 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-03-04 16:56:06,095 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 128 xjuncts. [2019-03-04 16:56:07,125 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 54 dim-0 vars, and 9 xjuncts. [2019-03-04 16:56:07,126 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:131, output treesize:1043 [2019-03-04 16:56:20,515 WARN L181 SmtUtils]: Spent 11.06 s on a formula simplification. DAG size of input: 556 DAG size of output: 119 [2019-03-04 16:56:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:20,524 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:20,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:56:20,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:56:20,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:56:20,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:56:20,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:56:20,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=22, Unknown=1, NotChecked=0, Total=42 [2019-03-04 16:56:20,553 INFO L87 Difference]: Start difference. First operand 36 states and 128 transitions. Second operand 4 states. [2019-03-04 16:56:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:20,634 INFO L93 Difference]: Finished difference Result 40 states and 140 transitions. [2019-03-04 16:56:20,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:56:20,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:56:20,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:20,636 INFO L225 Difference]: With dead ends: 40 [2019-03-04 16:56:20,636 INFO L226 Difference]: Without dead ends: 39 [2019-03-04 16:56:20,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19, Invalid=22, Unknown=1, NotChecked=0, Total=42 [2019-03-04 16:56:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-03-04 16:56:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-03-04 16:56:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 16:56:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 138 transitions. [2019-03-04 16:56:20,647 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 138 transitions. Word has length 4 [2019-03-04 16:56:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:20,647 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 138 transitions. [2019-03-04 16:56:20,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:56:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 138 transitions. [2019-03-04 16:56:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:56:20,648 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:20,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:56:20,649 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash 954990, now seen corresponding path program 1 times [2019-03-04 16:56:20,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:20,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:20,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:20,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:20,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:20,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:20,755 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:56:20,756 INFO L207 CegarAbsIntRunner]: [0], [22], [32], [35] [2019-03-04 16:56:20,761 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:20,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:21,376 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:21,377 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:56:21,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:21,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:21,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:21,377 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-03-04 16:56:21,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:21,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:21,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-03-04 16:56:21,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:21,544 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:56:21,544 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:21,558 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:21,596 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:21,635 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:21,676 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:21,796 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:21,859 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:21,942 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,031 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:56:22,063 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:56:22,067 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:56:22,071 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:56:22,077 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:56:22,084 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:56:22,088 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:56:22,094 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:56:22,095 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,110 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,127 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,143 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,159 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,219 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,237 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,252 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,350 INFO L309 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-03-04 16:56:22,350 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-03-04 16:56:22,547 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-03-04 16:56:22,572 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:56:22,572 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,669 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:22,670 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:127 [2019-03-04 16:56:22,753 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:56:22,754 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:22,838 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:22,839 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:103 [2019-03-04 16:56:23,173 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-03-04 16:56:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:23,175 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:23,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:23,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:56:23,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:23,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:56:23,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:56:23,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:56:23,657 INFO L87 Difference]: Start difference. First operand 38 states and 138 transitions. Second operand 8 states. [2019-03-04 16:56:24,568 WARN L181 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-03-04 16:56:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:29,035 INFO L93 Difference]: Finished difference Result 84 states and 220 transitions. [2019-03-04 16:56:29,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:56:29,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:56:29,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:29,037 INFO L225 Difference]: With dead ends: 84 [2019-03-04 16:56:29,037 INFO L226 Difference]: Without dead ends: 82 [2019-03-04 16:56:29,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:56:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-03-04 16:56:29,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 43. [2019-03-04 16:56:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-03-04 16:56:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 174 transitions. [2019-03-04 16:56:29,048 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 174 transitions. Word has length 4 [2019-03-04 16:56:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:29,048 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 174 transitions. [2019-03-04 16:56:29,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:56:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 174 transitions. [2019-03-04 16:56:29,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:56:29,049 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:29,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:56:29,049 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:29,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:29,050 INFO L82 PathProgramCache]: Analyzing trace with hash 954618, now seen corresponding path program 1 times [2019-03-04 16:56:29,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:29,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:29,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:29,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:29,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:29,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:29,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:29,130 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:56:29,130 INFO L207 CegarAbsIntRunner]: [0], [10], [32], [35] [2019-03-04 16:56:29,131 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:29,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:29,709 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:29,709 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:56:29,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:29,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:29,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:29,709 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-03-04 16:56:29,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:29,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:29,727 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-03-04 16:56:29,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:29,913 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:56:29,913 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:29,919 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:29,932 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:29,960 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:29,997 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:30,038 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:30,097 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:30,167 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:30,266 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:56:30,285 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:56:30,318 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:56:30,350 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:56:30,383 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:56:30,416 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:56:30,445 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:56:30,472 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:56:30,473 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:30,696 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:30,894 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:31,110 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:31,137 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:31,155 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:31,172 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:31,189 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:31,286 INFO L309 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-03-04 16:56:31,287 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-03-04 16:56:31,367 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:56:31,368 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:31,506 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:31,506 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:127 [2019-03-04 16:56:31,554 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:56:31,554 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:31,627 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:31,628 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:109 [2019-03-04 16:56:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:31,654 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:31,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:31,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:56:31,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:31,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:56:31,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:56:31,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:56:31,698 INFO L87 Difference]: Start difference. First operand 43 states and 174 transitions. Second operand 8 states. [2019-03-04 16:56:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:36,027 INFO L93 Difference]: Finished difference Result 81 states and 223 transitions. [2019-03-04 16:56:36,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:56:36,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:56:36,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:36,029 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:56:36,029 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:56:36,030 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-03-04 16:56:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:56:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 43. [2019-03-04 16:56:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-03-04 16:56:36,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 174 transitions. [2019-03-04 16:56:36,040 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 174 transitions. Word has length 4 [2019-03-04 16:56:36,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:36,040 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 174 transitions. [2019-03-04 16:56:36,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:56:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 174 transitions. [2019-03-04 16:56:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:56:36,041 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:36,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:56:36,041 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:36,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:36,041 INFO L82 PathProgramCache]: Analyzing trace with hash 955114, now seen corresponding path program 1 times [2019-03-04 16:56:36,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:36,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:36,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:36,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:36,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:36,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:36,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:36,165 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:56:36,166 INFO L207 CegarAbsIntRunner]: [0], [26], [32], [35] [2019-03-04 16:56:36,166 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:36,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:36,856 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:36,856 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:56:36,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:36,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:36,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:36,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:36,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:36,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:36,892 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-03-04 16:56:36,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:37,092 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:56:37,092 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,105 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,134 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,171 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,232 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,294 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,407 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,486 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,582 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:56:37,588 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:56:37,592 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:56:37,597 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:56:37,603 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:56:37,610 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:56:37,615 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:56:37,621 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:56:37,622 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,639 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,656 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,674 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,691 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,708 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,726 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,746 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:37,845 INFO L309 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-03-04 16:56:37,845 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-03-04 16:56:37,888 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:56:37,889 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:38,732 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:38,732 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:127 [2019-03-04 16:56:38,782 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:56:38,783 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:38,855 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:38,855 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:109 [2019-03-04 16:56:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:39,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:39,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:39,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:56:39,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:39,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:56:39,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:56:39,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:56:39,056 INFO L87 Difference]: Start difference. First operand 43 states and 174 transitions. Second operand 8 states. [2019-03-04 16:56:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:40,632 INFO L93 Difference]: Finished difference Result 81 states and 223 transitions. [2019-03-04 16:56:40,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:56:40,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:56:40,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:40,634 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:56:40,634 INFO L226 Difference]: Without dead ends: 79 [2019-03-04 16:56:40,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:56:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-03-04 16:56:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 44. [2019-03-04 16:56:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-03-04 16:56:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 175 transitions. [2019-03-04 16:56:40,646 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 175 transitions. Word has length 4 [2019-03-04 16:56:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:40,647 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 175 transitions. [2019-03-04 16:56:40,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:56:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 175 transitions. [2019-03-04 16:56:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:56:40,647 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:40,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:56:40,649 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash 954742, now seen corresponding path program 1 times [2019-03-04 16:56:40,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:40,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:40,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:40,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:40,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:40,947 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-03-04 16:56:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:40,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:40,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:40,979 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:56:40,979 INFO L207 CegarAbsIntRunner]: [0], [14], [32], [35] [2019-03-04 16:56:40,981 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:40,981 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:41,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:41,603 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:56:41,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:41,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:41,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:41,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:41,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:41,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:41,645 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-03-04 16:56:41,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:41,676 INFO L453 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 27 treesize of output 30 [2019-03-04 16:56:41,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,732 INFO L453 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 30 treesize of output 32 [2019-03-04 16:56:41,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,754 INFO L453 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 32 treesize of output 34 [2019-03-04 16:56:41,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,773 INFO L453 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 34 treesize of output 36 [2019-03-04 16:56:41,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,793 INFO L453 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 36 treesize of output 38 [2019-03-04 16:56:41,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,819 INFO L453 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 38 treesize of output 40 [2019-03-04 16:56:41,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,854 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:56:41,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:41,899 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:56:41,899 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:41,920 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:41,941 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:41,959 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:41,980 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,000 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,019 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,039 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,138 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:56:42,138 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,140 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,150 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,173 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,204 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,242 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,289 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,354 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,451 INFO L309 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-03-04 16:56:42,451 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:147, output treesize:153 [2019-03-04 16:56:42,488 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:56:42,489 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,587 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:42,588 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:163, output treesize:127 [2019-03-04 16:56:42,637 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:56:42,638 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:42,730 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:42,731 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:137, output treesize:103 [2019-03-04 16:56:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:42,812 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:42,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:42,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:56:42,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:42,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:56:42,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:56:42,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:56:42,862 INFO L87 Difference]: Start difference. First operand 44 states and 175 transitions. Second operand 8 states. [2019-03-04 16:56:46,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:46,507 INFO L93 Difference]: Finished difference Result 99 states and 274 transitions. [2019-03-04 16:56:46,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:56:46,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:56:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:46,510 INFO L225 Difference]: With dead ends: 99 [2019-03-04 16:56:46,510 INFO L226 Difference]: Without dead ends: 95 [2019-03-04 16:56:46,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:56:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-03-04 16:56:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 52. [2019-03-04 16:56:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:56:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 210 transitions. [2019-03-04 16:56:46,525 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 210 transitions. Word has length 4 [2019-03-04 16:56:46,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:46,526 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 210 transitions. [2019-03-04 16:56:46,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:56:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 210 transitions. [2019-03-04 16:56:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:56:46,527 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:46,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:56:46,527 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:46,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:46,527 INFO L82 PathProgramCache]: Analyzing trace with hash 941536, now seen corresponding path program 1 times [2019-03-04 16:56:46,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:46,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:46,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:46,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:46,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:46,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:46,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:46,611 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:56:46,611 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [35] [2019-03-04 16:56:46,612 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:46,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:46,936 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:46,936 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-03-04 16:56:46,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:46,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:46,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:46,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:46,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:46,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:46,950 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:56:46,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:46,957 INFO L453 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 27 treesize of output 30 [2019-03-04 16:56:46,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:46,963 INFO L453 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 30 treesize of output 32 [2019-03-04 16:56:46,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:46,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:46,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:46,974 INFO L453 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 32 treesize of output 34 [2019-03-04 16:56:46,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:46,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:46,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:46,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:46,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:46,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:46,994 INFO L453 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 34 treesize of output 36 [2019-03-04 16:56:47,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,033 INFO L453 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 36 treesize of output 38 [2019-03-04 16:56:47,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,059 INFO L453 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 38 treesize of output 40 [2019-03-04 16:56:47,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,092 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:56:47,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:47,177 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:56:47,178 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,196 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,216 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,235 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,255 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,273 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,293 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,312 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,410 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:56:47,410 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,479 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,491 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,514 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,540 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,574 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,618 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:47,688 INFO L309 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-03-04 16:56:47,689 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:56:48,136 WARN L181 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-03-04 16:56:48,171 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:56:48,171 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:48,874 INFO L309 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-03-04 16:56:48,875 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:56:49,101 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-03-04 16:56:49,408 INFO L453 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 48 treesize of output 50 [2019-03-04 16:56:49,409 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:50,019 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:50,019 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-03-04 16:56:50,249 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-03-04 16:56:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:50,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:50,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:50,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:56:50,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:50,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:56:50,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:56:50,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:56:50,639 INFO L87 Difference]: Start difference. First operand 52 states and 210 transitions. Second operand 8 states. [2019-03-04 16:56:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:51,199 INFO L93 Difference]: Finished difference Result 101 states and 289 transitions. [2019-03-04 16:56:51,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:56:51,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:56:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:51,201 INFO L225 Difference]: With dead ends: 101 [2019-03-04 16:56:51,201 INFO L226 Difference]: Without dead ends: 99 [2019-03-04 16:56:51,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:56:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-03-04 16:56:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 59. [2019-03-04 16:56:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-03-04 16:56:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 243 transitions. [2019-03-04 16:56:51,216 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 243 transitions. Word has length 4 [2019-03-04 16:56:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:51,216 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 243 transitions. [2019-03-04 16:56:51,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:56:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 243 transitions. [2019-03-04 16:56:51,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:56:51,217 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:51,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:56:51,218 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:51,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:51,218 INFO L82 PathProgramCache]: Analyzing trace with hash 941164, now seen corresponding path program 1 times [2019-03-04 16:56:51,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:51,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:51,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:51,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:51,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:51,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:51,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:51,357 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:56:51,358 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [35] [2019-03-04 16:56:51,359 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:51,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:51,626 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:51,627 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-03-04 16:56:51,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:51,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:51,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:51,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:51,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:51,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:51,641 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:56:51,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:51,752 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:56:51,753 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:51,776 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:51,786 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:51,806 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:51,830 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:51,863 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:51,908 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:51,985 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:56:51,989 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:56:51,992 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:56:51,997 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:56:52,003 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:56:52,035 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:56:52,048 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:56:52,104 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:56:52,105 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:52,119 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:52,135 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:52,152 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:52,168 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:52,185 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:52,199 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:52,215 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:52,286 INFO L309 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-03-04 16:56:52,286 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:56:52,370 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:56:52,370 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:52,434 INFO L309 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-03-04 16:56:52,434 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:56:52,496 INFO L453 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 48 treesize of output 50 [2019-03-04 16:56:52,497 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:52,545 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:52,546 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:84 [2019-03-04 16:56:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:52,573 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:52,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:52,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:56:52,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:52,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:56:52,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:56:52,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:56:52,615 INFO L87 Difference]: Start difference. First operand 59 states and 243 transitions. Second operand 8 states. [2019-03-04 16:56:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:53,628 INFO L93 Difference]: Finished difference Result 99 states and 302 transitions. [2019-03-04 16:56:53,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:56:53,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:56:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:53,630 INFO L225 Difference]: With dead ends: 99 [2019-03-04 16:56:53,630 INFO L226 Difference]: Without dead ends: 98 [2019-03-04 16:56:53,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:56:53,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-03-04 16:56:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 61. [2019-03-04 16:56:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:56:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 261 transitions. [2019-03-04 16:56:53,646 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 261 transitions. Word has length 4 [2019-03-04 16:56:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:53,646 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 261 transitions. [2019-03-04 16:56:53,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:56:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 261 transitions. [2019-03-04 16:56:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:56:53,647 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:53,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:56:53,647 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:53,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:53,648 INFO L82 PathProgramCache]: Analyzing trace with hash 941660, now seen corresponding path program 1 times [2019-03-04 16:56:53,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:53,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:53,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:53,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:53,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:53,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:53,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:53,744 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:56:53,744 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [35] [2019-03-04 16:56:53,745 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:53,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:54,017 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:54,017 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-03-04 16:56:54,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:54,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:54,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:54,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:54,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:54,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:54,032 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:56:54,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:54,038 INFO L453 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 27 treesize of output 30 [2019-03-04 16:56:54,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,048 INFO L453 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 30 treesize of output 32 [2019-03-04 16:56:54,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,068 INFO L453 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 32 treesize of output 34 [2019-03-04 16:56:54,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,089 INFO L453 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 34 treesize of output 36 [2019-03-04 16:56:54,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,111 INFO L453 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 36 treesize of output 38 [2019-03-04 16:56:54,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,139 INFO L453 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 38 treesize of output 40 [2019-03-04 16:56:54,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,171 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:56:54,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:56:54,259 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:56:54,260 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,303 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,323 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,340 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,360 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,379 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,398 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,418 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,500 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:56:54,501 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,517 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,529 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,552 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,584 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,621 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,666 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,738 INFO L309 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-03-04 16:56:54,739 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:56:54,817 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:56:54,817 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:54,913 INFO L309 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-03-04 16:56:54,914 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:56:54,961 INFO L453 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 48 treesize of output 50 [2019-03-04 16:56:54,961 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:55,009 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:55,010 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:84 [2019-03-04 16:56:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:55,035 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:55,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:55,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:56:55,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:55,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:56:55,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:56:55,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:56:55,076 INFO L87 Difference]: Start difference. First operand 61 states and 261 transitions. Second operand 8 states. [2019-03-04 16:56:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:55,781 INFO L93 Difference]: Finished difference Result 101 states and 320 transitions. [2019-03-04 16:56:55,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:56:55,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:56:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:55,783 INFO L225 Difference]: With dead ends: 101 [2019-03-04 16:56:55,783 INFO L226 Difference]: Without dead ends: 99 [2019-03-04 16:56:55,784 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-03-04 16:56:55,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-03-04 16:56:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2019-03-04 16:56:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-03-04 16:56:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 278 transitions. [2019-03-04 16:56:55,798 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 278 transitions. Word has length 4 [2019-03-04 16:56:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:55,799 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 278 transitions. [2019-03-04 16:56:55,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:56:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 278 transitions. [2019-03-04 16:56:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:56:55,799 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:55,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:56:55,800 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash 941288, now seen corresponding path program 1 times [2019-03-04 16:56:55,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:55,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:55,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:55,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:55,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:55,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:55,879 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:56:55,879 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [35] [2019-03-04 16:56:55,881 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:55,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:56,173 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:56,173 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-03-04 16:56:56,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:56,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:56,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:56,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:56,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:56,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:56,190 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:56:56,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:56,297 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:56:56,298 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,309 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,332 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,355 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,385 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,425 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,469 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,528 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:56:56,532 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:56:56,555 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:56:56,558 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:56:56,562 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:56:56,568 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:56:56,580 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:56:56,637 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:56:56,638 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,654 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,670 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,685 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,701 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,717 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,733 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,749 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:56,839 INFO L309 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-03-04 16:56:56,839 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:56:56,945 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:56:56,945 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:57,657 INFO L309 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-03-04 16:56:57,658 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:56:57,881 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-03-04 16:56:58,109 INFO L453 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 48 treesize of output 46 [2019-03-04 16:56:58,110 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:58,264 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:56:58,265 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-03-04 16:56:58,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:58,289 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:58,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:58,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:56:58,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:58,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:56:58,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:56:58,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:56:58,330 INFO L87 Difference]: Start difference. First operand 62 states and 278 transitions. Second operand 8 states. [2019-03-04 16:56:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:59,042 INFO L93 Difference]: Finished difference Result 106 states and 350 transitions. [2019-03-04 16:56:59,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:56:59,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:56:59,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:59,044 INFO L225 Difference]: With dead ends: 106 [2019-03-04 16:56:59,044 INFO L226 Difference]: Without dead ends: 104 [2019-03-04 16:56:59,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:56:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-03-04 16:56:59,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 65. [2019-03-04 16:56:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-03-04 16:56:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 304 transitions. [2019-03-04 16:56:59,059 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 304 transitions. Word has length 4 [2019-03-04 16:56:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:59,059 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 304 transitions. [2019-03-04 16:56:59,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:56:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 304 transitions. [2019-03-04 16:56:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:56:59,060 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:59,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:56:59,061 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash 941784, now seen corresponding path program 1 times [2019-03-04 16:56:59,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:59,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:59,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:59,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:59,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:59,391 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-03-04 16:56:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:59,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:59,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:59,594 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:56:59,595 INFO L207 CegarAbsIntRunner]: [0], [18], [30], [35] [2019-03-04 16:56:59,596 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:56:59,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:56:59,972 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:56:59,972 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-03-04 16:56:59,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:59,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:56:59,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:59,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:56:59,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:59,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:59,988 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:56:59,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:59,996 INFO L453 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 27 treesize of output 30 [2019-03-04 16:57:00,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,004 INFO L453 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 30 treesize of output 32 [2019-03-04 16:57:00,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,016 INFO L453 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 32 treesize of output 34 [2019-03-04 16:57:00,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,041 INFO L453 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 34 treesize of output 36 [2019-03-04 16:57:00,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,072 INFO L453 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 36 treesize of output 38 [2019-03-04 16:57:00,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,117 INFO L453 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 38 treesize of output 40 [2019-03-04 16:57:00,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,151 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:00,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:00,300 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:57:00,301 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,318 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,338 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,357 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,377 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,395 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,415 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,434 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,515 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:57:00,516 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,528 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,544 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,572 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,608 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,671 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,715 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,787 INFO L309 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-03-04 16:57:00,787 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:57:00,834 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:57:00,835 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,899 INFO L309 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-03-04 16:57:00,899 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:57:00,939 INFO L453 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 48 treesize of output 46 [2019-03-04 16:57:00,940 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:00,985 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:00,985 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-03-04 16:57:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:01,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:01,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:01,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:57:01,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:01,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:57:01,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:57:01,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:57:01,063 INFO L87 Difference]: Start difference. First operand 65 states and 304 transitions. Second operand 8 states. [2019-03-04 16:57:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:01,692 INFO L93 Difference]: Finished difference Result 107 states and 376 transitions. [2019-03-04 16:57:01,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:57:01,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:57:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:01,695 INFO L225 Difference]: With dead ends: 107 [2019-03-04 16:57:01,695 INFO L226 Difference]: Without dead ends: 99 [2019-03-04 16:57:01,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:57:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-03-04 16:57:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 66. [2019-03-04 16:57:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-03-04 16:57:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 328 transitions. [2019-03-04 16:57:01,708 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 328 transitions. Word has length 4 [2019-03-04 16:57:01,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:01,709 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 328 transitions. [2019-03-04 16:57:01,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:57:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 328 transitions. [2019-03-04 16:57:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:57:01,709 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:01,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:57:01,710 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:01,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:01,710 INFO L82 PathProgramCache]: Analyzing trace with hash 930314, now seen corresponding path program 1 times [2019-03-04 16:57:01,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:01,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:01,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:01,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:01,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:01,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:01,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:01,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:57:01,804 INFO L207 CegarAbsIntRunner]: [0], [6], [32], [35] [2019-03-04 16:57:01,805 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:01,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:02,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:02,503 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:57:02,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:02,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:02,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:02,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:02,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:02,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:02,548 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:57:02,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:02,901 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:57:02,901 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:02,907 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:02,918 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:02,936 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:02,967 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:03,000 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:03,047 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:03,101 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:57:03,106 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:57:03,110 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:57:03,114 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:57:03,119 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:57:03,124 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:57:03,129 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:03,202 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:57:03,203 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:03,220 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:03,236 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:03,253 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:03,269 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:03,286 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:03,303 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:03,319 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:03,392 INFO L309 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-03-04 16:57:03,393 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-03-04 16:57:03,435 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 53 [2019-03-04 16:57:03,436 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:57:03,527 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-03-04 16:57:03,527 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:135, output treesize:201 [2019-03-04 16:57:03,682 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 111 treesize of output 151 [2019-03-04 16:57:03,683 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-03-04 16:57:03,702 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 64 xjuncts. [2019-03-04 16:57:05,072 INFO L453 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 7 new quantified variables, introduced 18 case distinctions, treesize of input 106 treesize of output 143 [2019-03-04 16:57:05,073 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:05,534 INFO L309 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-1 vars, End of recursive call: 49 dim-0 vars, and 8 xjuncts. [2019-03-04 16:57:05,535 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 15 variables, input treesize:218, output treesize:692 [2019-03-04 16:57:14,091 WARN L181 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 385 DAG size of output: 114 [2019-03-04 16:57:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:14,093 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:14,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:14,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-03-04 16:57:14,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:14,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:57:14,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:57:14,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:57:14,129 INFO L87 Difference]: Start difference. First operand 66 states and 328 transitions. Second operand 8 states. [2019-03-04 16:57:15,448 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 118 [2019-03-04 16:57:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:18,853 INFO L93 Difference]: Finished difference Result 155 states and 556 transitions. [2019-03-04 16:57:18,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:57:18,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:57:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:18,855 INFO L225 Difference]: With dead ends: 155 [2019-03-04 16:57:18,855 INFO L226 Difference]: Without dead ends: 152 [2019-03-04 16:57:18,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:57:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-03-04 16:57:18,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 78. [2019-03-04 16:57:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-03-04 16:57:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 438 transitions. [2019-03-04 16:57:18,870 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 438 transitions. Word has length 4 [2019-03-04 16:57:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:18,870 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 438 transitions. [2019-03-04 16:57:18,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:57:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 438 transitions. [2019-03-04 16:57:18,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:57:18,871 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:18,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:57:18,872 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:18,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:18,872 INFO L82 PathProgramCache]: Analyzing trace with hash 930440, now seen corresponding path program 1 times [2019-03-04 16:57:18,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:18,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:18,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:18,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:18,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:18,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:18,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:18,969 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:57:18,969 INFO L207 CegarAbsIntRunner]: [0], [6], [36], [37] [2019-03-04 16:57:18,975 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:18,975 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:19,158 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:19,158 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-03-04 16:57:19,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:19,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:19,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:19,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:19,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:19,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:19,176 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:57:19,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:19,183 INFO L453 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 27 treesize of output 30 [2019-03-04 16:57:19,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,192 INFO L453 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 30 treesize of output 32 [2019-03-04 16:57:19,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,205 INFO L453 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 32 treesize of output 34 [2019-03-04 16:57:19,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,220 INFO L453 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 34 treesize of output 36 [2019-03-04 16:57:19,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,250 INFO L453 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 36 treesize of output 38 [2019-03-04 16:57:19,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,290 INFO L453 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 38 treesize of output 40 [2019-03-04 16:57:19,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,349 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:19,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:19,445 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:57:19,446 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,464 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,484 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,503 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,523 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,541 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,560 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,579 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,660 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:57:19,661 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,669 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,684 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,705 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,729 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,758 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,801 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,874 INFO L309 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-03-04 16:57:19,874 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:121, output treesize:125 [2019-03-04 16:57:19,926 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:57:19,926 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:19,991 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:19,991 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-03-04 16:57:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:20,013 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:20,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:20,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:57:20,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:20,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:57:20,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:57:20,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:57:20,042 INFO L87 Difference]: Start difference. First operand 78 states and 438 transitions. Second operand 6 states. [2019-03-04 16:57:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:20,393 INFO L93 Difference]: Finished difference Result 104 states and 471 transitions. [2019-03-04 16:57:20,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:57:20,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:57:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:20,395 INFO L225 Difference]: With dead ends: 104 [2019-03-04 16:57:20,395 INFO L226 Difference]: Without dead ends: 103 [2019-03-04 16:57:20,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:57:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-03-04 16:57:20,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 80. [2019-03-04 16:57:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-03-04 16:57:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 448 transitions. [2019-03-04 16:57:20,414 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 448 transitions. Word has length 4 [2019-03-04 16:57:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:20,414 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 448 transitions. [2019-03-04 16:57:20,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:57:20,414 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 448 transitions. [2019-03-04 16:57:20,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:57:20,415 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:20,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:57:20,415 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:20,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:20,416 INFO L82 PathProgramCache]: Analyzing trace with hash 945816, now seen corresponding path program 1 times [2019-03-04 16:57:20,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:20,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:20,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:20,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:20,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:20,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:20,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:20,462 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:57:20,463 INFO L207 CegarAbsIntRunner]: [0], [22], [36], [37] [2019-03-04 16:57:20,464 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:20,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:20,756 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:20,756 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-03-04 16:57:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:20,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:20,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:20,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:20,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:20,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:20,796 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:57:20,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:20,826 INFO L453 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 27 treesize of output 30 [2019-03-04 16:57:20,862 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 35 [2019-03-04 16:57:20,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,878 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:57:20,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,895 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:57:20,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,912 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:57:20,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,939 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:57:20,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,975 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:20,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:20,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:21,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:21,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:21,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:21,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:21,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:21,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:21,063 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:57:21,064 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,083 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,103 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,122 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,140 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,159 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,177 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,197 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,275 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 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-03-04 16:57:21,275 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,280 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,291 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,306 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,336 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,378 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,448 INFO L309 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-03-04 16:57:21,449 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-03-04 16:57:21,484 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:57:21,484 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:21,546 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:21,547 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:92 [2019-03-04 16:57:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:21,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:21,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:21,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:57:21,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:21,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:57:21,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:57:21,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:57:21,595 INFO L87 Difference]: Start difference. First operand 80 states and 448 transitions. Second operand 6 states. [2019-03-04 16:57:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:21,903 INFO L93 Difference]: Finished difference Result 108 states and 483 transitions. [2019-03-04 16:57:21,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:57:21,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:57:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:21,905 INFO L225 Difference]: With dead ends: 108 [2019-03-04 16:57:21,905 INFO L226 Difference]: Without dead ends: 107 [2019-03-04 16:57:21,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:57:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-03-04 16:57:21,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2019-03-04 16:57:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-03-04 16:57:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 448 transitions. [2019-03-04 16:57:21,924 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 448 transitions. Word has length 4 [2019-03-04 16:57:21,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:21,924 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 448 transitions. [2019-03-04 16:57:21,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:57:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 448 transitions. [2019-03-04 16:57:21,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:57:21,925 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:21,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:57:21,925 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:21,925 INFO L82 PathProgramCache]: Analyzing trace with hash 945008, now seen corresponding path program 1 times [2019-03-04 16:57:21,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:21,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:21,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:21,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:21,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:22,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:22,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:22,112 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:57:22,112 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [35] [2019-03-04 16:57:22,115 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:22,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:22,358 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:22,359 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-03-04 16:57:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:22,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:22,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:22,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:22,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:22,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:22,376 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:57:22,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:22,453 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:57:22,454 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,461 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,470 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,489 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,513 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,546 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,591 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,643 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:57:22,647 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:57:22,650 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:57:22,654 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:57:22,659 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:57:22,663 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:57:22,683 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:22,736 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:57:22,737 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,753 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,771 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,788 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,806 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,821 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,838 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,855 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:22,926 INFO L309 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-03-04 16:57:22,927 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:57:23,011 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:57:23,012 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:23,123 INFO L309 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-03-04 16:57:23,124 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-03-04 16:57:23,187 INFO L453 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 44 [2019-03-04 16:57:23,187 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:23,234 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:23,235 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:78 [2019-03-04 16:57:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:23,256 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:23,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:23,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:57:23,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:23,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:57:23,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:57:23,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:57:23,305 INFO L87 Difference]: Start difference. First operand 80 states and 448 transitions. Second operand 8 states. [2019-03-04 16:57:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:24,600 INFO L93 Difference]: Finished difference Result 154 states and 652 transitions. [2019-03-04 16:57:24,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:57:24,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:57:24,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:24,605 INFO L225 Difference]: With dead ends: 154 [2019-03-04 16:57:24,605 INFO L226 Difference]: Without dead ends: 153 [2019-03-04 16:57:24,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:57:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-03-04 16:57:24,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 92. [2019-03-04 16:57:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-03-04 16:57:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 556 transitions. [2019-03-04 16:57:24,622 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 556 transitions. Word has length 4 [2019-03-04 16:57:24,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:24,622 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 556 transitions. [2019-03-04 16:57:24,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:57:24,623 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 556 transitions. [2019-03-04 16:57:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:57:24,623 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:24,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:57:24,624 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:24,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:24,624 INFO L82 PathProgramCache]: Analyzing trace with hash 945504, now seen corresponding path program 1 times [2019-03-04 16:57:24,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:24,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:24,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:24,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:24,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:24,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:24,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:24,749 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:57:24,749 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [35] [2019-03-04 16:57:24,750 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:24,751 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:25,002 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:25,002 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-03-04 16:57:25,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:25,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:25,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:25,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:25,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:25,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:25,018 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:57:25,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:25,024 INFO L453 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 27 treesize of output 30 [2019-03-04 16:57:25,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,033 INFO L453 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 30 treesize of output 32 [2019-03-04 16:57:25,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,052 INFO L453 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 32 treesize of output 34 [2019-03-04 16:57:25,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,073 INFO L453 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 34 treesize of output 36 [2019-03-04 16:57:25,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,092 INFO L453 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 36 treesize of output 38 [2019-03-04 16:57:25,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,118 INFO L453 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 38 treesize of output 40 [2019-03-04 16:57:25,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,151 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:25,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:25,234 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:57:25,235 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,253 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,272 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,291 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,310 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,327 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,345 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,364 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,446 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:57:25,446 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,453 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,463 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,482 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,508 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,535 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,578 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,649 INFO L309 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-03-04 16:57:25,650 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:57:25,697 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:57:25,698 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,761 INFO L309 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-03-04 16:57:25,762 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-03-04 16:57:25,799 INFO L453 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 44 [2019-03-04 16:57:25,799 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:25,846 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:25,846 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:78 [2019-03-04 16:57:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:25,866 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:25,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:25,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:57:25,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:25,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:57:25,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:57:25,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:57:25,913 INFO L87 Difference]: Start difference. First operand 92 states and 556 transitions. Second operand 8 states. [2019-03-04 16:57:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:27,091 INFO L93 Difference]: Finished difference Result 148 states and 688 transitions. [2019-03-04 16:57:27,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:57:27,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:57:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:27,093 INFO L225 Difference]: With dead ends: 148 [2019-03-04 16:57:27,093 INFO L226 Difference]: Without dead ends: 146 [2019-03-04 16:57:27,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:57:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-03-04 16:57:27,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2019-03-04 16:57:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-03-04 16:57:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 590 transitions. [2019-03-04 16:57:27,118 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 590 transitions. Word has length 4 [2019-03-04 16:57:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:27,118 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 590 transitions. [2019-03-04 16:57:27,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:57:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 590 transitions. [2019-03-04 16:57:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:57:27,119 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:27,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:57:27,119 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:27,120 INFO L82 PathProgramCache]: Analyzing trace with hash 933972, now seen corresponding path program 1 times [2019-03-04 16:57:27,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:27,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:27,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:27,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:27,264 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-03-04 16:57:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:27,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:27,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:27,288 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:57:27,288 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [35] [2019-03-04 16:57:27,289 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:27,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:27,519 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:27,519 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-03-04 16:57:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:27,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:27,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:27,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:27,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:27,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:27,533 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:57:27,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:27,540 INFO L453 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 27 treesize of output 30 [2019-03-04 16:57:27,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,551 INFO L453 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 30 treesize of output 32 [2019-03-04 16:57:27,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,564 INFO L453 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 32 treesize of output 34 [2019-03-04 16:57:27,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,612 INFO L453 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 34 treesize of output 36 [2019-03-04 16:57:27,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,632 INFO L453 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 36 treesize of output 38 [2019-03-04 16:57:27,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,660 INFO L453 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 38 treesize of output 40 [2019-03-04 16:57:27,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,694 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:27,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:27,781 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:57:27,782 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:27,798 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:27,817 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:27,836 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:27,856 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:27,876 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:27,896 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:27,915 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:27,996 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:57:27,996 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:28,007 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:28,028 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:28,054 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:28,082 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:28,118 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:28,163 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:28,237 INFO L309 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-03-04 16:57:28,237 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:57:28,288 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:57:28,288 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:28,374 INFO L309 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-03-04 16:57:28,375 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:57:28,416 INFO L453 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 48 treesize of output 50 [2019-03-04 16:57:28,417 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:28,464 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:28,465 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:84 [2019-03-04 16:57:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:28,485 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:28,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:28,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:57:28,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:28,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:57:28,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:57:28,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:57:28,529 INFO L87 Difference]: Start difference. First operand 103 states and 590 transitions. Second operand 8 states. [2019-03-04 16:57:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:29,340 INFO L93 Difference]: Finished difference Result 145 states and 646 transitions. [2019-03-04 16:57:29,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:57:29,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:57:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:29,342 INFO L225 Difference]: With dead ends: 145 [2019-03-04 16:57:29,342 INFO L226 Difference]: Without dead ends: 143 [2019-03-04 16:57:29,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:57:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-03-04 16:57:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 104. [2019-03-04 16:57:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-03-04 16:57:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 599 transitions. [2019-03-04 16:57:29,366 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 599 transitions. Word has length 4 [2019-03-04 16:57:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:29,367 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 599 transitions. [2019-03-04 16:57:29,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:57:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 599 transitions. [2019-03-04 16:57:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:57:29,367 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:29,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:57:29,368 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:29,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:29,368 INFO L82 PathProgramCache]: Analyzing trace with hash 938128, now seen corresponding path program 1 times [2019-03-04 16:57:29,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:29,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:29,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:29,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:29,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:29,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:29,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:29,561 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:57:29,561 INFO L207 CegarAbsIntRunner]: [0], [14], [36], [37] [2019-03-04 16:57:29,562 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:29,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:29,726 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:29,726 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-03-04 16:57:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:29,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:29,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:29,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:29,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:29,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:29,741 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:57:29,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:29,746 INFO L453 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 27 treesize of output 30 [2019-03-04 16:57:29,775 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 35 [2019-03-04 16:57:29,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,791 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:57:29,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,806 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:57:29,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,826 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:57:29,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,855 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:57:29,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,889 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:29,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:29,977 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:57:29,978 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:29,997 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,016 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,037 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,055 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,073 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,092 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,111 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,183 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 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-03-04 16:57:30,184 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,191 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,204 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,221 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,249 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,291 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,360 INFO L309 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-03-04 16:57:30,361 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-03-04 16:57:30,395 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:57:30,395 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:30,456 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:30,457 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:92 [2019-03-04 16:57:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:30,504 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:30,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:30,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:57:30,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:30,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:57:30,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:57:30,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:57:30,535 INFO L87 Difference]: Start difference. First operand 104 states and 599 transitions. Second operand 6 states. [2019-03-04 16:57:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:31,051 INFO L93 Difference]: Finished difference Result 124 states and 613 transitions. [2019-03-04 16:57:31,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:57:31,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:57:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:31,054 INFO L225 Difference]: With dead ends: 124 [2019-03-04 16:57:31,054 INFO L226 Difference]: Without dead ends: 123 [2019-03-04 16:57:31,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-03-04 16:57:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-03-04 16:57:31,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2019-03-04 16:57:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-03-04 16:57:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-03-04 16:57:31,075 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 4 [2019-03-04 16:57:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:31,075 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-03-04 16:57:31,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:57:31,075 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-03-04 16:57:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:57:31,076 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:31,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:57:31,076 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:31,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:31,077 INFO L82 PathProgramCache]: Analyzing trace with hash 937816, now seen corresponding path program 1 times [2019-03-04 16:57:31,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:31,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:31,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:31,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:31,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:31,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:31,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:31,245 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:57:31,246 INFO L207 CegarAbsIntRunner]: [0], [14], [26], [35] [2019-03-04 16:57:31,247 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:31,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:31,588 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:31,588 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-03-04 16:57:31,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:31,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:31,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:31,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:31,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:31,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:31,625 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:57:31,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:31,657 INFO L453 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 27 treesize of output 30 [2019-03-04 16:57:31,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:31,705 INFO L453 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 30 treesize of output 32 [2019-03-04 16:57:31,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:31,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:31,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:31,797 INFO L453 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 32 treesize of output 34 [2019-03-04 16:57:31,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:31,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:31,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:31,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:31,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:31,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:31,964 INFO L301 Elim1Store]: Index analysis took 135 ms [2019-03-04 16:57:31,965 INFO L453 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 34 treesize of output 36 [2019-03-04 16:57:32,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,198 INFO L301 Elim1Store]: Index analysis took 208 ms [2019-03-04 16:57:32,199 INFO L453 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 36 treesize of output 38 [2019-03-04 16:57:32,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,583 INFO L301 Elim1Store]: Index analysis took 356 ms [2019-03-04 16:57:32,584 INFO L453 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 38 treesize of output 40 [2019-03-04 16:57:32,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:32,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,021 INFO L301 Elim1Store]: Index analysis took 408 ms [2019-03-04 16:57:33,022 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:33,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:33,103 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:57:33,104 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,124 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,143 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,163 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,183 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,203 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,223 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,242 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,322 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:57:33,323 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,335 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,354 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,377 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,407 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,446 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,490 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,563 INFO L309 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-03-04 16:57:33,563 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:57:33,678 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:57:33,678 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,743 INFO L309 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-03-04 16:57:33,744 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-03-04 16:57:33,790 INFO L453 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-03-04 16:57:33,790 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:33,838 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:33,838 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:78 [2019-03-04 16:57:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:33,860 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:33,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:33,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:57:33,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:33,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:57:33,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:57:33,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:57:33,906 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 8 states. [2019-03-04 16:57:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:34,809 INFO L93 Difference]: Finished difference Result 176 states and 800 transitions. [2019-03-04 16:57:34,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:57:34,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:57:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:34,810 INFO L225 Difference]: With dead ends: 176 [2019-03-04 16:57:34,810 INFO L226 Difference]: Without dead ends: 174 [2019-03-04 16:57:34,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:57:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-03-04 16:57:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 108. [2019-03-04 16:57:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:57:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 670 transitions. [2019-03-04 16:57:34,837 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 670 transitions. Word has length 4 [2019-03-04 16:57:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:34,837 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 670 transitions. [2019-03-04 16:57:34,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:57:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 670 transitions. [2019-03-04 16:57:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:57:34,838 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:34,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:57:34,838 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:34,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash 953504, now seen corresponding path program 1 times [2019-03-04 16:57:34,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:34,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:34,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:34,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:34,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:34,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:34,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:34,928 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:57:34,928 INFO L207 CegarAbsIntRunner]: [0], [30], [36], [37] [2019-03-04 16:57:34,929 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:34,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:35,084 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:35,085 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-03-04 16:57:35,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:35,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:35,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:35,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:35,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:35,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:35,100 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:57:35,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:35,163 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 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-03-04 16:57:35,164 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,174 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,195 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,220 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,253 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,296 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,343 INFO L453 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 27 treesize of output 30 [2019-03-04 16:57:35,357 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 35 [2019-03-04 16:57:35,377 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 14 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:57:35,388 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 17 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:57:35,396 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:57:35,401 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:57:35,408 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:35,468 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:57:35,469 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,485 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,500 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,516 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,531 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,548 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,565 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,580 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,648 INFO L309 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-03-04 16:57:35,648 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:113, output treesize:121 [2019-03-04 16:57:35,685 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:57:35,685 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:35,744 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:35,745 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:126, output treesize:92 [2019-03-04 16:57:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:35,795 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:35,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:35,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:57:35,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:35,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:57:35,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:57:35,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:57:35,822 INFO L87 Difference]: Start difference. First operand 108 states and 670 transitions. Second operand 6 states. [2019-03-04 16:57:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:36,174 INFO L93 Difference]: Finished difference Result 135 states and 696 transitions. [2019-03-04 16:57:36,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:57:36,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:57:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:36,178 INFO L225 Difference]: With dead ends: 135 [2019-03-04 16:57:36,178 INFO L226 Difference]: Without dead ends: 134 [2019-03-04 16:57:36,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:57:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-03-04 16:57:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 108. [2019-03-04 16:57:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:57:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 670 transitions. [2019-03-04 16:57:36,199 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 670 transitions. Word has length 4 [2019-03-04 16:57:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:36,199 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 670 transitions. [2019-03-04 16:57:36,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:57:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 670 transitions. [2019-03-04 16:57:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:57:36,200 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:36,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:57:36,200 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:36,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:36,200 INFO L82 PathProgramCache]: Analyzing trace with hash 29600478, now seen corresponding path program 1 times [2019-03-04 16:57:36,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:36,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:36,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:36,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:36,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:36,437 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 15 [2019-03-04 16:57:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:36,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:36,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:36,561 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:57:36,562 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [32], [35] [2019-03-04 16:57:36,563 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:36,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:37,206 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:37,206 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:57:37,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:37,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:37,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:37,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:37,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:37,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:37,221 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 22 conjunts are in the unsatisfiable core [2019-03-04 16:57:37,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:37,231 INFO L453 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 27 treesize of output 30 [2019-03-04 16:57:37,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,236 INFO L453 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 30 treesize of output 32 [2019-03-04 16:57:37,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,250 INFO L453 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 32 treesize of output 34 [2019-03-04 16:57:37,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,276 INFO L453 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 34 treesize of output 36 [2019-03-04 16:57:37,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,304 INFO L453 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 36 treesize of output 38 [2019-03-04 16:57:37,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,328 INFO L453 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 38 treesize of output 40 [2019-03-04 16:57:37,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,363 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:37,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:57:37,408 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:57:37,408 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,427 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,446 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,464 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,484 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,503 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,522 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,542 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,639 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:57:37,640 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,643 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,655 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,673 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,704 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,750 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,796 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,883 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:37,980 INFO L309 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-03-04 16:57:37,980 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:147, output treesize:153 [2019-03-04 16:57:38,062 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:57:38,063 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:38,223 INFO L309 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-03-04 16:57:38,223 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:163, output treesize:127 [2019-03-04 16:57:38,553 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:57:38,554 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:38,895 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:38,896 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:109 [2019-03-04 16:57:38,982 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 16 case distinctions, treesize of input 55 treesize of output 60 [2019-03-04 16:57:38,983 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:39,054 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:39,055 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:119, output treesize:89 [2019-03-04 16:57:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:39,098 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:39,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:39,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:57:39,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:39,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:57:39,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:57:39,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:57:39,155 INFO L87 Difference]: Start difference. First operand 108 states and 670 transitions. Second operand 10 states. [2019-03-04 16:57:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:40,215 INFO L93 Difference]: Finished difference Result 212 states and 968 transitions. [2019-03-04 16:57:40,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:57:40,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:57:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:40,218 INFO L225 Difference]: With dead ends: 212 [2019-03-04 16:57:40,218 INFO L226 Difference]: Without dead ends: 205 [2019-03-04 16:57:40,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:57:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-03-04 16:57:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 122. [2019-03-04 16:57:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-03-04 16:57:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 789 transitions. [2019-03-04 16:57:40,245 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 789 transitions. Word has length 5 [2019-03-04 16:57:40,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:40,245 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 789 transitions. [2019-03-04 16:57:40,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:57:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 789 transitions. [2019-03-04 16:57:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:57:40,246 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:40,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:57:40,246 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:40,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash 29600106, now seen corresponding path program 1 times [2019-03-04 16:57:40,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:40,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:40,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:40,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:40,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:40,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:40,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:40,398 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:57:40,398 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [32], [35] [2019-03-04 16:57:40,399 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:40,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:41,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:41,053 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:57:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:41,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:41,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:41,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:41,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:41,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:41,068 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 22 conjunts are in the unsatisfiable core [2019-03-04 16:57:41,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:41,187 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:57:41,187 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,193 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,216 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,251 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,305 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,365 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,441 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,520 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,608 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:57:41,612 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:57:41,615 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:57:41,620 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:57:41,626 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:57:41,631 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:57:41,637 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:41,670 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:57:41,671 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,693 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,710 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,727 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,742 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,759 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,776 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,792 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:41,888 INFO L309 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-03-04 16:57:41,889 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:147, output treesize:153 [2019-03-04 16:57:41,927 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:57:41,927 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:42,020 INFO L309 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-03-04 16:57:42,021 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:163, output treesize:127 [2019-03-04 16:57:42,081 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:57:42,081 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:42,155 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:42,156 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:109 [2019-03-04 16:57:42,236 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 16 case distinctions, treesize of input 55 treesize of output 64 [2019-03-04 16:57:42,237 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:42,297 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:42,298 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:119, output treesize:99 [2019-03-04 16:57:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:42,343 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:42,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:42,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:57:42,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:42,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:57:42,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:57:42,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:57:42,402 INFO L87 Difference]: Start difference. First operand 122 states and 789 transitions. Second operand 10 states. [2019-03-04 16:57:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:46,174 INFO L93 Difference]: Finished difference Result 169 states and 850 transitions. [2019-03-04 16:57:46,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:57:46,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:57:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:46,177 INFO L225 Difference]: With dead ends: 169 [2019-03-04 16:57:46,177 INFO L226 Difference]: Without dead ends: 168 [2019-03-04 16:57:46,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:57:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-03-04 16:57:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2019-03-04 16:57:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-03-04 16:57:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 762 transitions. [2019-03-04 16:57:46,213 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 762 transitions. Word has length 5 [2019-03-04 16:57:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:46,213 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 762 transitions. [2019-03-04 16:57:46,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:57:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 762 transitions. [2019-03-04 16:57:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:57:46,214 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:46,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:57:46,215 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:46,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:46,215 INFO L82 PathProgramCache]: Analyzing trace with hash 29600602, now seen corresponding path program 1 times [2019-03-04 16:57:46,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:46,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:46,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:46,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:46,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:46,612 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-03-04 16:57:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:46,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:46,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:46,652 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:57:46,652 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [32], [35] [2019-03-04 16:57:46,654 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:46,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:47,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:47,304 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:57:47,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:47,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:47,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:47,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:47,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:47,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:47,321 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 22 conjunts are in the unsatisfiable core [2019-03-04 16:57:47,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:47,413 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-03-04 16:57:47,414 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,425 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,438 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,459 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,486 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,527 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,571 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,641 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,717 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:57:47,722 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:57:47,727 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:57:47,732 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:57:47,736 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:57:47,741 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:57:47,747 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:47,752 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-03-04 16:57:47,753 INFO L309 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,770 INFO L309 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,787 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,805 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,820 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,838 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,855 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,871 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:47,968 INFO L309 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-03-04 16:57:47,968 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:147, output treesize:153 [2019-03-04 16:57:48,011 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-03-04 16:57:48,011 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:48,105 INFO L309 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-03-04 16:57:48,106 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:163, output treesize:127 [2019-03-04 16:57:48,156 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 55 [2019-03-04 16:57:48,157 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:48,244 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:48,245 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:137, output treesize:109 [2019-03-04 16:57:48,344 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 16 case distinctions, treesize of input 55 treesize of output 64 [2019-03-04 16:57:48,345 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:48,404 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:57:48,405 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:119, output treesize:99 [2019-03-04 16:57:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:48,485 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:48,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:48,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:57:48,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:48,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:57:48,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:57:48,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:57:48,547 INFO L87 Difference]: Start difference. First operand 119 states and 762 transitions. Second operand 10 states. [2019-03-04 16:57:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:52,314 INFO L93 Difference]: Finished difference Result 176 states and 845 transitions. [2019-03-04 16:57:52,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:57:52,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:57:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:52,318 INFO L225 Difference]: With dead ends: 176 [2019-03-04 16:57:52,318 INFO L226 Difference]: Without dead ends: 172 [2019-03-04 16:57:52,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:57:52,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-03-04 16:57:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 125. [2019-03-04 16:57:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-03-04 16:57:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 788 transitions. [2019-03-04 16:57:52,355 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 788 transitions. Word has length 5 [2019-03-04 16:57:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:52,355 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 788 transitions. [2019-03-04 16:57:52,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:57:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 788 transitions. [2019-03-04 16:57:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:57:52,356 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:52,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:57:52,356 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:52,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:52,357 INFO L82 PathProgramCache]: Analyzing trace with hash 29588822, now seen corresponding path program 1 times [2019-03-04 16:57:52,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:52,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:52,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:52,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:52,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:52,688 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2019-03-04 16:57:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:52,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:52,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:52,732 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:57:52,732 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [32], [35] [2019-03-04 16:57:52,733 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:57:52,733 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:57:53,391 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:57:53,391 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:57:53,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:53,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:57:53,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:53,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:57:53,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:53,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:53,405 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:57:53,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:53,475 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:57:53,476 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,485 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,503 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,521 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,547 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,588 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,634 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,688 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-03-04 16:57:53,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-03-04 16:57:53,695 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:57:53,700 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-03-04 16:57:53,704 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:57:53,708 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:57:53,712 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2019-03-04 16:57:53,765 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:57:53,766 INFO L309 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,781 INFO L309 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,798 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,814 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,830 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,847 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,864 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,882 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:57:53,957 INFO L309 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-03-04 16:57:53,957 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 7 variables, input treesize:121, output treesize:125 [2019-03-04 16:57:54,090 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 51 treesize of output 95 [2019-03-04 16:57:54,091 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-03-04 16:57:54,106 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 128 xjuncts. [2019-03-04 16:57:54,988 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 41 dim-0 vars, and 8 xjuncts. [2019-03-04 16:57:54,988 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:135, output treesize:982 [2019-03-04 16:57:55,851 WARN L181 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 490 DAG size of output: 191 [2019-03-04 16:57:55,877 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 130 [2019-03-04 16:57:55,878 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,166 INFO L453 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 108 treesize of output 106 [2019-03-04 16:57:56,167 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,384 INFO L453 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 108 treesize of output 110 [2019-03-04 16:57:56,385 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:56,556 INFO L309 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 3 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2019-03-04 16:57:56,557 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 18 variables, input treesize:389, output treesize:277 [2019-03-04 16:57:56,813 INFO L453 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 3 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 93 [2019-03-04 16:57:56,814 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:57,071 INFO L453 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 117 [2019-03-04 16:57:57,072 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:57,254 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 125 [2019-03-04 16:57:57,255 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:57:57,405 INFO L309 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 3 dim-1 vars, End of recursive call: 18 dim-0 vars, and 3 xjuncts. [2019-03-04 16:57:57,406 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 21 variables, input treesize:307, output treesize:245 [2019-03-04 16:57:57,753 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:57:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:57,755 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:57,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:57,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-03-04 16:57:57,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:57,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:57:57,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:57:57,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:57:57,802 INFO L87 Difference]: Start difference. First operand 125 states and 788 transitions. Second operand 10 states. [2019-03-04 16:57:58,295 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 70 [2019-03-04 16:58:01,425 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-03-04 16:58:01,427 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:652) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) 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) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2019-03-04 16:58:01,430 INFO L168 Benchmark]: Toolchain (without parser) took 156918.51 ms. Allocated memory was 141.6 MB in the beginning and 880.8 MB in the end (delta: 739.2 MB). Free memory was 109.0 MB in the beginning and 226.0 MB in the end (delta: -116.9 MB). Peak memory consumption was 622.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:58:01,431 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:58:01,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.25 ms. Allocated memory is still 141.6 MB. Free memory was 108.8 MB in the beginning and 106.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:58:01,432 INFO L168 Benchmark]: Boogie Preprocessor took 27.75 ms. Allocated memory is still 141.6 MB. Free memory was 106.5 MB in the beginning and 105.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:58:01,432 INFO L168 Benchmark]: RCFGBuilder took 554.95 ms. Allocated memory is still 141.6 MB. Free memory was 105.2 MB in the beginning and 92.2 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-03-04 16:58:01,432 INFO L168 Benchmark]: TraceAbstraction took 156267.72 ms. Allocated memory was 141.6 MB in the beginning and 880.8 MB in the end (delta: 739.2 MB). Free memory was 92.0 MB in the beginning and 226.0 MB in the end (delta: -133.9 MB). Peak memory consumption was 605.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:58:01,434 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.19 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.25 ms. Allocated memory is still 141.6 MB. Free memory was 108.8 MB in the beginning and 106.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.75 ms. Allocated memory is still 141.6 MB. Free memory was 106.5 MB in the beginning and 105.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 554.95 ms. Allocated memory is still 141.6 MB. Free memory was 105.2 MB in the beginning and 92.2 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 156267.72 ms. Allocated memory was 141.6 MB in the beginning and 880.8 MB in the end (delta: 739.2 MB). Free memory was 92.0 MB in the beginning and 226.0 MB in the end (delta: -133.9 MB). Peak memory consumption was 605.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...