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_camel.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:24:06,377 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:24:06,379 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:24:06,395 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:24:06,396 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:24:06,397 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:24:06,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:24:06,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:24:06,403 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:24:06,405 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:24:06,408 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:24:06,409 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:24:06,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:24:06,418 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:24:06,419 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:24:06,420 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:24:06,421 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:24:06,425 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:24:06,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:24:06,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:24:06,433 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:24:06,435 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:24:06,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:24:06,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:24:06,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:24:06,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:24:06,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:24:06,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:24:06,443 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:24:06,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:24:06,446 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:24:06,447 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:24:06,447 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:24:06,447 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:24:06,450 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:24:06,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:24:06,451 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_camel.epf [2019-03-04 16:24:06,467 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:24:06,468 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:24:06,469 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:24:06,469 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:24:06,469 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:24:06,469 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:24:06,469 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:24:06,470 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:24:06,470 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:24:06,470 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:24:06,470 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:24:06,470 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:24:06,471 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:24:06,472 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:24:06,472 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:24:06,472 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:24:06,472 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:24:06,473 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:24:06,473 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:24:06,473 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:24:06,473 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:24:06,473 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:24:06,473 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:24:06,474 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:24:06,474 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:24:06,474 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:24:06,474 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:24:06,474 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:24:06,475 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:24:06,475 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:24:06,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:24:06,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:24:06,476 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:24:06,476 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:24:06,476 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:24:06,476 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:24:06,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:24:06,477 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:24:06,477 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:24:06,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:24:06,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:24:06,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:24:06,539 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:24:06,539 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:24:06,540 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-03-04 16:24:06,540 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-03-04 16:24:06,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:24:06,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:24:06,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:24:06,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:24:06,588 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:24:06,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:06" (1/1) ... [2019-03-04 16:24:06,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:06" (1/1) ... [2019-03-04 16:24:06,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:24:06,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:24:06,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:24:06,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:24:06,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:06" (1/1) ... [2019-03-04 16:24:06,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:06" (1/1) ... [2019-03-04 16:24:06,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:06" (1/1) ... [2019-03-04 16:24:06,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:06" (1/1) ... [2019-03-04 16:24:06,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:06" (1/1) ... [2019-03-04 16:24:06,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:06" (1/1) ... [2019-03-04 16:24:06,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:06" (1/1) ... [2019-03-04 16:24:06,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:24:06,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:24:06,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:24:06,672 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:24:06,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:06" (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:24:06,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:24:06,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:24:07,071 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:24:07,072 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-03-04 16:24:07,074 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:24:07 BoogieIcfgContainer [2019-03-04 16:24:07,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:24:07,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:24:07,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:24:07,081 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:24:07,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:06" (1/2) ... [2019-03-04 16:24:07,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49920806 and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:24:07, skipping insertion in model container [2019-03-04 16:24:07,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:24:07" (2/2) ... [2019-03-04 16:24:07,085 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-03-04 16:24:07,113 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:24:07,134 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-03-04 16:24:07,174 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-03-04 16:24:07,225 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:24:07,226 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:24:07,226 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:24:07,227 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:24:07,227 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:24:07,227 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:24:07,227 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:24:07,228 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:24:07,228 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:24:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-03-04 16:24:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:24:07,258 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:07,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:24:07,262 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:07,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:07,269 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-03-04 16:24:07,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:07,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:07,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:07,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:07,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:07,468 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:24:07,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:24:07,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:24:07,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:24:07,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:24:07,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:24:07,487 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-03-04 16:24:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:07,681 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-03-04 16:24:07,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:24:07,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:24:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:07,697 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:24:07,698 INFO L226 Difference]: Without dead ends: 20 [2019-03-04 16:24:07,701 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:24:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-03-04 16:24:07,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-03-04 16:24:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:24:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-03-04 16:24:07,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-03-04 16:24:07,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:07,740 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-03-04 16:24:07,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:24:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-03-04 16:24:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:07,741 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:07,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:07,741 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:07,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:07,742 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-03-04 16:24:07,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:07,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:07,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:07,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:07,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:07,919 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:24:07,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:07,919 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:07,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:07,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:07,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:08,010 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 18 treesize of output 21 [2019-03-04 16:24:08,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,023 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 21 treesize of output 23 [2019-03-04 16:24:08,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,084 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 23 treesize of output 25 [2019-03-04 16:24:08,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,105 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 25 treesize of output 27 [2019-03-04 16:24:08,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,202 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:08,203 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,232 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,255 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,315 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,441 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,486 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:08,486 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:08,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:08,639 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:08,641 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:08,721 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:08,721 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:08,752 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:24:08,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:08,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:08,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:08,774 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-03-04 16:24:08,940 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-03-04 16:24:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:09,387 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-03-04 16:24:09,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:09,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:09,389 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:24:09,389 INFO L226 Difference]: Without dead ends: 37 [2019-03-04 16:24:09,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-03-04 16:24:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-03-04 16:24:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:24:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-03-04 16:24:09,397 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-03-04 16:24:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:09,397 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-03-04 16:24:09,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-03-04 16:24:09,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:09,399 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:09,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:09,399 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:09,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:09,400 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-03-04 16:24:09,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:09,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:09,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:09,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:09,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:09,598 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-03-04 16:24:09,607 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:24:09,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:09,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:09,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:09,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:09,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:09,666 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 18 treesize of output 21 [2019-03-04 16:24:09,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,672 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 21 treesize of output 23 [2019-03-04 16:24:09,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,696 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 23 treesize of output 25 [2019-03-04 16:24:09,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,744 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 25 treesize of output 27 [2019-03-04 16:24:09,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,810 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:09,811 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,827 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,840 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,851 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,873 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,906 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:09,907 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:09,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:09,953 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:09,954 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,982 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:09,983 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:10,010 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:24:10,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:10,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:10,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:10,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:10,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:10,029 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 6 states. [2019-03-04 16:24:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:10,386 INFO L93 Difference]: Finished difference Result 39 states and 61 transitions. [2019-03-04 16:24:10,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:10,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:10,388 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:24:10,389 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:24:10,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:10,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:24:10,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 16. [2019-03-04 16:24:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:24:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 36 transitions. [2019-03-04 16:24:10,396 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 36 transitions. Word has length 3 [2019-03-04 16:24:10,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:10,397 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 36 transitions. [2019-03-04 16:24:10,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 36 transitions. [2019-03-04 16:24:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:10,398 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:10,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:10,398 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:10,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 1 times [2019-03-04 16:24:10,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:10,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:10,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:10,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:10,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:10,463 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:24:10,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:10,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:10,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:10,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:10,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:10,495 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 18 treesize of output 21 [2019-03-04 16:24:10,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,515 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 21 treesize of output 23 [2019-03-04 16:24:10,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,532 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 23 treesize of output 25 [2019-03-04 16:24:10,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,556 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 25 treesize of output 27 [2019-03-04 16:24:10,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,604 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:10,604 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,637 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,650 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,661 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,675 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,731 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:10,731 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:10,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:10,779 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:10,780 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:10,814 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:10,815 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:10,846 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:24:10,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:10,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:10,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:10,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:10,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:10,867 INFO L87 Difference]: Start difference. First operand 16 states and 36 transitions. Second operand 6 states. [2019-03-04 16:24:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:11,085 INFO L93 Difference]: Finished difference Result 29 states and 57 transitions. [2019-03-04 16:24:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:11,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:11,087 INFO L225 Difference]: With dead ends: 29 [2019-03-04 16:24:11,087 INFO L226 Difference]: Without dead ends: 28 [2019-03-04 16:24:11,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-03-04 16:24:11,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2019-03-04 16:24:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:24:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 42 transitions. [2019-03-04 16:24:11,094 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 42 transitions. Word has length 3 [2019-03-04 16:24:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:11,094 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 42 transitions. [2019-03-04 16:24:11,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 42 transitions. [2019-03-04 16:24:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:11,095 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:11,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:11,095 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:11,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:11,096 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-03-04 16:24:11,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:11,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:11,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:11,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:11,134 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:24:11,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:24:11,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:24:11,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:24:11,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:24:11,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:24:11,135 INFO L87 Difference]: Start difference. First operand 17 states and 42 transitions. Second operand 3 states. [2019-03-04 16:24:11,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:11,182 INFO L93 Difference]: Finished difference Result 19 states and 42 transitions. [2019-03-04 16:24:11,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:24:11,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:24:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:11,183 INFO L225 Difference]: With dead ends: 19 [2019-03-04 16:24:11,183 INFO L226 Difference]: Without dead ends: 18 [2019-03-04 16:24:11,183 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:24:11,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-03-04 16:24:11,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-03-04 16:24:11,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:24:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-03-04 16:24:11,188 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 3 [2019-03-04 16:24:11,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:11,189 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-03-04 16:24:11,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:24:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-03-04 16:24:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:11,189 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:11,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:11,190 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:11,190 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-03-04 16:24:11,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:11,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:11,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:11,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:11,266 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:24:11,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:11,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:11,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:11,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:11,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:11,296 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 18 treesize of output 21 [2019-03-04 16:24:11,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,309 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 21 treesize of output 23 [2019-03-04 16:24:11,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,328 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 23 treesize of output 25 [2019-03-04 16:24:11,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,362 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 25 treesize of output 27 [2019-03-04 16:24:11,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,398 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:11,399 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:11,481 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:11,492 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:11,504 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:11,517 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:11,541 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:11,542 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:11,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:11,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:11,590 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:11,621 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:11,621 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:11,645 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:24:11,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:11,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:11,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:11,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:11,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:11,666 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 6 states. [2019-03-04 16:24:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:11,944 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2019-03-04 16:24:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:11,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:11,945 INFO L225 Difference]: With dead ends: 37 [2019-03-04 16:24:11,945 INFO L226 Difference]: Without dead ends: 36 [2019-03-04 16:24:11,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-03-04 16:24:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 18. [2019-03-04 16:24:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:24:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2019-03-04 16:24:11,953 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 47 transitions. Word has length 3 [2019-03-04 16:24:11,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:11,953 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 47 transitions. [2019-03-04 16:24:11,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 47 transitions. [2019-03-04 16:24:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:11,954 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:11,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:11,954 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:11,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:11,954 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-03-04 16:24:11,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:11,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:11,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:11,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:12,099 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:24:12,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:12,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:12,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:12,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:12,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:12,126 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 18 treesize of output 21 [2019-03-04 16:24:12,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,136 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 21 treesize of output 23 [2019-03-04 16:24:12,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,153 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 23 treesize of output 25 [2019-03-04 16:24:12,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,180 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 25 treesize of output 27 [2019-03-04 16:24:12,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,207 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:12,208 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,221 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,232 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,243 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,257 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,277 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:12,277 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:12,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,367 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:12,368 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,432 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:12,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:12,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:12,476 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:12,477 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:12,498 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:12,499 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:12,537 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:24:12,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:12,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:12,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:12,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:12,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:12,558 INFO L87 Difference]: Start difference. First operand 18 states and 47 transitions. Second operand 8 states. [2019-03-04 16:24:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:13,305 INFO L93 Difference]: Finished difference Result 48 states and 94 transitions. [2019-03-04 16:24:13,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:13,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:13,307 INFO L225 Difference]: With dead ends: 48 [2019-03-04 16:24:13,307 INFO L226 Difference]: Without dead ends: 45 [2019-03-04 16:24:13,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-03-04 16:24:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 23. [2019-03-04 16:24:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-03-04 16:24:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 64 transitions. [2019-03-04 16:24:13,316 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 64 transitions. Word has length 4 [2019-03-04 16:24:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:13,316 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 64 transitions. [2019-03-04 16:24:13,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 64 transitions. [2019-03-04 16:24:13,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:13,317 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:13,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:13,317 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:13,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:13,318 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2019-03-04 16:24:13,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:13,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:13,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:13,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:13,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:13,380 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:24:13,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:13,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:13,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:13,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:13,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:13,413 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 18 treesize of output 21 [2019-03-04 16:24:13,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,419 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 21 treesize of output 23 [2019-03-04 16:24:13,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,437 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 23 treesize of output 25 [2019-03-04 16:24:13,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,478 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 25 treesize of output 27 [2019-03-04 16:24:13,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,508 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:13,509 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:13,518 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:13,529 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:13,540 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:13,551 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:13,571 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:13,572 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:13,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,638 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:13,638 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:13,658 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:13,658 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:13,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:13,916 INFO L301 Elim1Store]: Index analysis took 203 ms [2019-03-04 16:24:13,917 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:13,918 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,036 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:14,036 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:14,053 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:24:14,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:14,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:14,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:14,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:14,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:14,078 INFO L87 Difference]: Start difference. First operand 23 states and 64 transitions. Second operand 8 states. [2019-03-04 16:24:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:14,536 INFO L93 Difference]: Finished difference Result 49 states and 110 transitions. [2019-03-04 16:24:14,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:14,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:14,538 INFO L225 Difference]: With dead ends: 49 [2019-03-04 16:24:14,538 INFO L226 Difference]: Without dead ends: 48 [2019-03-04 16:24:14,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:14,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-03-04 16:24:14,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 24. [2019-03-04 16:24:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-03-04 16:24:14,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2019-03-04 16:24:14,548 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 70 transitions. Word has length 4 [2019-03-04 16:24:14,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:14,548 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 70 transitions. [2019-03-04 16:24:14,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 70 transitions. [2019-03-04 16:24:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:14,549 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:14,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:14,549 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:14,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:14,549 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-03-04 16:24:14,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:14,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:14,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:14,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:14,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:14,604 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:24:14,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:14,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:14,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:14,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:14,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:14,629 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 18 treesize of output 21 [2019-03-04 16:24:14,643 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 21 treesize of output 26 [2019-03-04 16:24:14,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,664 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:24:14,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,683 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:24:14,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,713 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:24:14,714 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,724 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,735 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,753 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,763 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,779 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:14,780 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:24:14,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:14,815 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:14,816 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:14,831 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:14,832 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:14,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:14,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:14,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:14,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:14,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:14,876 INFO L87 Difference]: Start difference. First operand 24 states and 70 transitions. Second operand 6 states. [2019-03-04 16:24:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:15,028 INFO L93 Difference]: Finished difference Result 35 states and 77 transitions. [2019-03-04 16:24:15,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:15,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:15,030 INFO L225 Difference]: With dead ends: 35 [2019-03-04 16:24:15,030 INFO L226 Difference]: Without dead ends: 34 [2019-03-04 16:24:15,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-03-04 16:24:15,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-03-04 16:24:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:24:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-03-04 16:24:15,038 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2019-03-04 16:24:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:15,038 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2019-03-04 16:24:15,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2019-03-04 16:24:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:15,039 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:15,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:15,039 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:15,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-03-04 16:24:15,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:15,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:15,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:15,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:15,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:15,150 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:24:15,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:15,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:15,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:15,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:15,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:15,223 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 18 treesize of output 21 [2019-03-04 16:24:15,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,274 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 21 treesize of output 23 [2019-03-04 16:24:15,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,328 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 23 treesize of output 25 [2019-03-04 16:24:15,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,343 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 25 treesize of output 27 [2019-03-04 16:24:15,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,361 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:15,362 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,372 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,407 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,428 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,439 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,458 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:15,459 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:15,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,547 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:15,548 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,568 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:15,568 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:15,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:15,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:15,611 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:15,629 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:15,630 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:24:15,655 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:24:15,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:15,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:15,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:15,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:15,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:15,679 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 8 states. [2019-03-04 16:24:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:16,383 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2019-03-04 16:24:16,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:16,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:16,384 INFO L225 Difference]: With dead ends: 47 [2019-03-04 16:24:16,384 INFO L226 Difference]: Without dead ends: 46 [2019-03-04 16:24:16,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:16,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-03-04 16:24:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 25. [2019-03-04 16:24:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:24:16,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-03-04 16:24:16,393 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2019-03-04 16:24:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:16,393 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2019-03-04 16:24:16,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2019-03-04 16:24:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:16,393 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:16,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:16,394 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:16,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:16,394 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-03-04 16:24:16,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:16,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:16,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:16,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:16,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:16,444 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:24:16,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:16,445 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:16,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:16,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:16,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:16,466 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 18 treesize of output 21 [2019-03-04 16:24:16,489 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 21 treesize of output 26 [2019-03-04 16:24:16,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,509 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:24:16,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,534 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:24:16,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,559 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:24:16,560 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,569 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,580 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,590 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,601 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,617 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:16,618 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:24:16,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:16,650 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:16,651 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:16,666 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:16,667 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:16,681 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:24:16,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:16,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:16,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:16,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:16,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:16,703 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 6 states. [2019-03-04 16:24:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:16,876 INFO L93 Difference]: Finished difference Result 43 states and 96 transitions. [2019-03-04 16:24:16,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:16,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:16,877 INFO L225 Difference]: With dead ends: 43 [2019-03-04 16:24:16,877 INFO L226 Difference]: Without dead ends: 42 [2019-03-04 16:24:16,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-03-04 16:24:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2019-03-04 16:24:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:24:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2019-03-04 16:24:16,885 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 4 [2019-03-04 16:24:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:16,885 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2019-03-04 16:24:16,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2019-03-04 16:24:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:16,886 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:16,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:16,886 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:16,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:16,887 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-03-04 16:24:16,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:16,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:16,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:16,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:16,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:17,006 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:24:17,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:17,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:17,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:17,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:17,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:17,027 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 18 treesize of output 21 [2019-03-04 16:24:17,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,032 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 21 treesize of output 23 [2019-03-04 16:24:17,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,056 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 23 treesize of output 25 [2019-03-04 16:24:17,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,065 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 25 treesize of output 27 [2019-03-04 16:24:17,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,080 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:17,080 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:17,090 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:17,099 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:17,109 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:17,119 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:17,137 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:17,137 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:17,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,222 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:17,223 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:17,243 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:17,243 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:17,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:17,303 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:17,303 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:17,365 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:17,366 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:17,393 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:24:17,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:17,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:17,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:17,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:17,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:17,412 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 8 states. [2019-03-04 16:24:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:17,997 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2019-03-04 16:24:17,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:17,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:17,999 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:24:17,999 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:24:18,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:24:18,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2019-03-04 16:24:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-03-04 16:24:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-03-04 16:24:18,010 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-03-04 16:24:18,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:18,010 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-03-04 16:24:18,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:18,011 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-03-04 16:24:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:18,011 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:18,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:18,012 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:18,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:18,012 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-03-04 16:24:18,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:18,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:18,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:18,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:18,116 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:24:18,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:18,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:18,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:18,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:18,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:18,150 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 18 treesize of output 21 [2019-03-04 16:24:18,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,156 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 21 treesize of output 23 [2019-03-04 16:24:18,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,165 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 23 treesize of output 25 [2019-03-04 16:24:18,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,192 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 25 treesize of output 27 [2019-03-04 16:24:18,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,209 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:18,210 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:18,219 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:18,230 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:18,242 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:18,252 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:18,271 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:18,272 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:18,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,314 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:18,314 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:18,333 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:18,334 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:18,352 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:24:18,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:18,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:18,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:18,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:18,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:18,376 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 6 states. [2019-03-04 16:24:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:18,573 INFO L93 Difference]: Finished difference Result 46 states and 114 transitions. [2019-03-04 16:24:18,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:18,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:18,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:18,574 INFO L225 Difference]: With dead ends: 46 [2019-03-04 16:24:18,574 INFO L226 Difference]: Without dead ends: 45 [2019-03-04 16:24:18,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:18,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-03-04 16:24:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-03-04 16:24:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-03-04 16:24:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2019-03-04 16:24:18,584 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 4 [2019-03-04 16:24:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:18,584 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2019-03-04 16:24:18,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2019-03-04 16:24:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:18,585 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:18,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:18,585 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash 947418, now seen corresponding path program 1 times [2019-03-04 16:24:18,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:18,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:18,619 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:24:18,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:24:18,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:24:18,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:24:18,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:24:18,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:24:18,620 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 3 states. [2019-03-04 16:24:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:18,698 INFO L93 Difference]: Finished difference Result 31 states and 100 transitions. [2019-03-04 16:24:18,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:24:18,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-03-04 16:24:18,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:18,699 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:24:18,699 INFO L226 Difference]: Without dead ends: 28 [2019-03-04 16:24:18,699 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:24:18,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-03-04 16:24:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-03-04 16:24:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-03-04 16:24:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 97 transitions. [2019-03-04 16:24:18,706 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 97 transitions. Word has length 4 [2019-03-04 16:24:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:18,706 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 97 transitions. [2019-03-04 16:24:18,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:24:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 97 transitions. [2019-03-04 16:24:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:18,707 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:18,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:18,707 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:18,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:18,707 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-03-04 16:24:18,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:18,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:18,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:18,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:18,828 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:24:18,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:18,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:18,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:18,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:18,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:18,871 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 18 treesize of output 21 [2019-03-04 16:24:18,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,875 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 21 treesize of output 23 [2019-03-04 16:24:18,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,890 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 23 treesize of output 25 [2019-03-04 16:24:18,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,908 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 25 treesize of output 27 [2019-03-04 16:24:18,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:18,922 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:18,923 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:18,941 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:18,950 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:18,961 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:18,972 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:18,992 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:18,992 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:19,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,023 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:19,024 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,044 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:19,045 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:19,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,079 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:19,080 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,095 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:19,096 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:19,109 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:24:19,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:19,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:19,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:19,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:19,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:19,129 INFO L87 Difference]: Start difference. First operand 28 states and 97 transitions. Second operand 8 states. [2019-03-04 16:24:19,507 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-03-04 16:24:19,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:19,821 INFO L93 Difference]: Finished difference Result 58 states and 150 transitions. [2019-03-04 16:24:19,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:19,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:19,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:19,823 INFO L225 Difference]: With dead ends: 58 [2019-03-04 16:24:19,823 INFO L226 Difference]: Without dead ends: 57 [2019-03-04 16:24:19,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:19,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-03-04 16:24:19,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2019-03-04 16:24:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-03-04 16:24:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-03-04 16:24:19,831 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-03-04 16:24:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:19,832 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-03-04 16:24:19,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-03-04 16:24:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:19,832 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:19,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:19,833 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:19,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:19,833 INFO L82 PathProgramCache]: Analyzing trace with hash 933900, now seen corresponding path program 1 times [2019-03-04 16:24:19,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:19,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:19,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:19,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:19,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:19,946 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:24:19,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:19,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:19,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:19,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:19,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:19,969 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 18 treesize of output 21 [2019-03-04 16:24:19,979 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 21 treesize of output 26 [2019-03-04 16:24:19,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:19,994 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:24:20,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,020 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:24:20,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,049 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:24:20,050 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,059 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,069 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,080 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,090 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,108 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:20,108 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:28, output treesize:35 [2019-03-04 16:24:20,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,136 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:20,136 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,152 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:20,152 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:20,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:24:20,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:20,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:20,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:20,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:20,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:20,183 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 6 states. [2019-03-04 16:24:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:20,303 INFO L93 Difference]: Finished difference Result 46 states and 150 transitions. [2019-03-04 16:24:20,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:20,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:20,305 INFO L225 Difference]: With dead ends: 46 [2019-03-04 16:24:20,305 INFO L226 Difference]: Without dead ends: 45 [2019-03-04 16:24:20,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-03-04 16:24:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-03-04 16:24:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-03-04 16:24:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 140 transitions. [2019-03-04 16:24:20,317 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 140 transitions. Word has length 4 [2019-03-04 16:24:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:20,317 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 140 transitions. [2019-03-04 16:24:20,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 140 transitions. [2019-03-04 16:24:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:20,318 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:20,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:20,318 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:20,319 INFO L82 PathProgramCache]: Analyzing trace with hash 937556, now seen corresponding path program 1 times [2019-03-04 16:24:20,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:20,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:20,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:20,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:20,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:20,404 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:24:20,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:20,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:20,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:20,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:20,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:20,426 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 18 treesize of output 21 [2019-03-04 16:24:20,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,436 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 21 treesize of output 23 [2019-03-04 16:24:20,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,448 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 23 treesize of output 25 [2019-03-04 16:24:20,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,462 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 25 treesize of output 27 [2019-03-04 16:24:20,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,484 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:20,485 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,496 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,505 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,628 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,638 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,658 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:20,659 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:20,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,700 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:20,701 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,719 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:20,719 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:20,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:20,756 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:20,756 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,777 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:20,777 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:20,806 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:24:20,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:20,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:20,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:20,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:20,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:20,828 INFO L87 Difference]: Start difference. First operand 35 states and 140 transitions. Second operand 8 states. [2019-03-04 16:24:21,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:21,344 INFO L93 Difference]: Finished difference Result 65 states and 188 transitions. [2019-03-04 16:24:21,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:21,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:21,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:21,346 INFO L225 Difference]: With dead ends: 65 [2019-03-04 16:24:21,346 INFO L226 Difference]: Without dead ends: 63 [2019-03-04 16:24:21,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-03-04 16:24:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2019-03-04 16:24:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:24:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 163 transitions. [2019-03-04 16:24:21,358 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 163 transitions. Word has length 4 [2019-03-04 16:24:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:21,359 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 163 transitions. [2019-03-04 16:24:21,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 163 transitions. [2019-03-04 16:24:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:21,360 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:21,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:21,360 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:21,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:21,360 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-03-04 16:24:21,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:21,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:21,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:21,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:21,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:21,417 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:24:21,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:21,417 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:21,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:21,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:21,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:21,436 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 18 treesize of output 21 [2019-03-04 16:24:21,445 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 21 treesize of output 26 [2019-03-04 16:24:21,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,458 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:24:21,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,475 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:24:21,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,498 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:24:21,499 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,507 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,518 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,528 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,536 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,554 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:21,554 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:24:21,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:21,592 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:21,592 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,607 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:21,608 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:21,622 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:24:21,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:21,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:21,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:21,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:21,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:21,644 INFO L87 Difference]: Start difference. First operand 41 states and 163 transitions. Second operand 6 states. [2019-03-04 16:24:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:22,219 INFO L93 Difference]: Finished difference Result 53 states and 177 transitions. [2019-03-04 16:24:22,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:22,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:22,220 INFO L225 Difference]: With dead ends: 53 [2019-03-04 16:24:22,221 INFO L226 Difference]: Without dead ends: 52 [2019-03-04 16:24:22,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-03-04 16:24:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2019-03-04 16:24:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-03-04 16:24:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 168 transitions. [2019-03-04 16:24:22,232 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 168 transitions. Word has length 4 [2019-03-04 16:24:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:22,232 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 168 transitions. [2019-03-04 16:24:22,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 168 transitions. [2019-03-04 16:24:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:22,233 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:22,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:22,233 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:22,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:22,234 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-03-04 16:24:22,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:22,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:22,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:22,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:22,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:22,397 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:24:22,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:22,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:22,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:22,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:22,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:22,419 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 18 treesize of output 21 [2019-03-04 16:24:22,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,459 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 21 treesize of output 23 [2019-03-04 16:24:22,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,464 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 23 treesize of output 25 [2019-03-04 16:24:22,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,475 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 25 treesize of output 27 [2019-03-04 16:24:22,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,491 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:22,491 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,502 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,512 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,523 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,534 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,556 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:22,556 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:22,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:22,590 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,616 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:22,617 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:22,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:22,656 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:22,657 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:22,675 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:22,676 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:22,708 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:24:22,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:22,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:22,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:22,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:22,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:22,728 INFO L87 Difference]: Start difference. First operand 42 states and 168 transitions. Second operand 8 states. [2019-03-04 16:24:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:23,294 INFO L93 Difference]: Finished difference Result 68 states and 217 transitions. [2019-03-04 16:24:23,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:23,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:23,296 INFO L225 Difference]: With dead ends: 68 [2019-03-04 16:24:23,296 INFO L226 Difference]: Without dead ends: 67 [2019-03-04 16:24:23,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:23,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-03-04 16:24:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2019-03-04 16:24:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-03-04 16:24:23,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 192 transitions. [2019-03-04 16:24:23,312 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 192 transitions. Word has length 4 [2019-03-04 16:24:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:23,312 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 192 transitions. [2019-03-04 16:24:23,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:23,313 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 192 transitions. [2019-03-04 16:24:23,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:23,313 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:23,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:23,314 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:23,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:23,314 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-03-04 16:24:23,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:23,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:23,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:23,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:23,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:23,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:23,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:23,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:23,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:23,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:23,427 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 18 treesize of output 21 [2019-03-04 16:24:23,448 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 21 treesize of output 26 [2019-03-04 16:24:23,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,463 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:24:23,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,486 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:24:23,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,509 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:24:23,510 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,520 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,545 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,556 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,566 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,584 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:23,584 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:24:23,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,623 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:23,623 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,637 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:23,638 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:23,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:23,661 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:23,662 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:23,682 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:23,682 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:23,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:23,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:23,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:23,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:23,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:23,718 INFO L87 Difference]: Start difference. First operand 46 states and 192 transitions. Second operand 8 states. [2019-03-04 16:24:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:24,411 INFO L93 Difference]: Finished difference Result 65 states and 213 transitions. [2019-03-04 16:24:24,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:24,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:24,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:24,413 INFO L225 Difference]: With dead ends: 65 [2019-03-04 16:24:24,413 INFO L226 Difference]: Without dead ends: 64 [2019-03-04 16:24:24,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-03-04 16:24:24,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2019-03-04 16:24:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-03-04 16:24:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 192 transitions. [2019-03-04 16:24:24,429 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 192 transitions. Word has length 5 [2019-03-04 16:24:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:24,430 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 192 transitions. [2019-03-04 16:24:24,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 192 transitions. [2019-03-04 16:24:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:24,430 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:24,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:24,431 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:24,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:24,431 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-03-04 16:24:24,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:24,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:24,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:24,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:24,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:24,697 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-03-04 16:24:24,756 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:24:24,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:24,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:24,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:24,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:24,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:24,777 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 18 treesize of output 21 [2019-03-04 16:24:24,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,781 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 21 treesize of output 23 [2019-03-04 16:24:24,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,788 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 23 treesize of output 25 [2019-03-04 16:24:24,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,796 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 25 treesize of output 27 [2019-03-04 16:24:24,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,812 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:24,813 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,822 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,833 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,841 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,852 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,871 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:24,872 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:24,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,926 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:24,926 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:24,946 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:24,946 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:24,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:24,998 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:24,999 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:25,040 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:25,040 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:25,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:25,078 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:25,078 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:25,097 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:25,098 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:24:25,134 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:24:25,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:25,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:25,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:25,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:25,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:25,159 INFO L87 Difference]: Start difference. First operand 46 states and 192 transitions. Second operand 10 states. [2019-03-04 16:24:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:25,921 INFO L93 Difference]: Finished difference Result 77 states and 240 transitions. [2019-03-04 16:24:25,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:25,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:25,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:25,923 INFO L225 Difference]: With dead ends: 77 [2019-03-04 16:24:25,923 INFO L226 Difference]: Without dead ends: 76 [2019-03-04 16:24:25,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-03-04 16:24:25,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 44. [2019-03-04 16:24:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-03-04 16:24:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 180 transitions. [2019-03-04 16:24:25,937 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 180 transitions. Word has length 5 [2019-03-04 16:24:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:25,937 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 180 transitions. [2019-03-04 16:24:25,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 180 transitions. [2019-03-04 16:24:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:25,938 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:25,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:25,938 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:25,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:25,938 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-03-04 16:24:25,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:25,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:25,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:25,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:25,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:26,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:24:26,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:26,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:26,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:26,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:26,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:26,061 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 18 treesize of output 21 [2019-03-04 16:24:26,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,066 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 21 treesize of output 23 [2019-03-04 16:24:26,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,076 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 23 treesize of output 25 [2019-03-04 16:24:26,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,086 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 25 treesize of output 27 [2019-03-04 16:24:26,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,116 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:26,116 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,165 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,174 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,185 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,195 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,215 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:26,215 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:26,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,250 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:26,251 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,268 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:26,268 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:26,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:26,444 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:26,445 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,463 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:26,464 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:26,486 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:24:26,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:26,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:26,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:26,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:26,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:26,510 INFO L87 Difference]: Start difference. First operand 44 states and 180 transitions. Second operand 8 states. [2019-03-04 16:24:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:26,921 INFO L93 Difference]: Finished difference Result 65 states and 208 transitions. [2019-03-04 16:24:26,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:26,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:26,925 INFO L225 Difference]: With dead ends: 65 [2019-03-04 16:24:26,926 INFO L226 Difference]: Without dead ends: 64 [2019-03-04 16:24:26,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-03-04 16:24:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 44. [2019-03-04 16:24:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-03-04 16:24:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 181 transitions. [2019-03-04 16:24:26,936 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 181 transitions. Word has length 5 [2019-03-04 16:24:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:26,937 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 181 transitions. [2019-03-04 16:24:26,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 181 transitions. [2019-03-04 16:24:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:26,937 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:26,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:26,938 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:26,938 INFO L82 PathProgramCache]: Analyzing trace with hash 29189286, now seen corresponding path program 1 times [2019-03-04 16:24:26,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:26,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:26,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:26,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:26,990 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:24:26,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:26,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:27,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:27,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:24:27,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:27,013 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 18 treesize of output 21 [2019-03-04 16:24:27,032 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 21 treesize of output 26 [2019-03-04 16:24:27,062 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:24:27,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,093 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:24:27,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,121 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:24:27,122 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,133 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,145 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,157 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,169 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,186 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:27,187 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-03-04 16:24:27,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,228 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:27,228 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,239 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:27,239 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:24:27,251 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:24:27,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:27,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:27,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:27,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:27,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:27,273 INFO L87 Difference]: Start difference. First operand 44 states and 181 transitions. Second operand 6 states. [2019-03-04 16:24:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:27,483 INFO L93 Difference]: Finished difference Result 52 states and 187 transitions. [2019-03-04 16:24:27,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:27,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:24:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:27,485 INFO L225 Difference]: With dead ends: 52 [2019-03-04 16:24:27,485 INFO L226 Difference]: Without dead ends: 51 [2019-03-04 16:24:27,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-03-04 16:24:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2019-03-04 16:24:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-03-04 16:24:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 182 transitions. [2019-03-04 16:24:27,494 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 182 transitions. Word has length 5 [2019-03-04 16:24:27,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:27,494 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 182 transitions. [2019-03-04 16:24:27,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:27,494 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 182 transitions. [2019-03-04 16:24:27,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:27,495 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:27,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:27,495 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:27,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:27,495 INFO L82 PathProgramCache]: Analyzing trace with hash 29175208, now seen corresponding path program 1 times [2019-03-04 16:24:27,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:27,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:27,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:27,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:27,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:27,620 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:24:27,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:27,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:27,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:27,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:27,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:24:27,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,651 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 21 treesize of output 23 [2019-03-04 16:24:27,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,659 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 23 treesize of output 25 [2019-03-04 16:24:27,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,671 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 25 treesize of output 27 [2019-03-04 16:24:27,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,755 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:27,756 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,767 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,778 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,788 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,799 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,826 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:27,826 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:27,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,869 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:27,870 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,890 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:27,890 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:27,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,061 INFO L301 Elim1Store]: Index analysis took 112 ms [2019-03-04 16:24:28,062 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:28,062 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:28,086 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:28,086 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:24:28,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:28,169 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:24:28,169 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:28,192 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:28,192 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:24:28,223 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:24:28,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:28,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:28,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:28,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:28,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:28,244 INFO L87 Difference]: Start difference. First operand 46 states and 182 transitions. Second operand 10 states. [2019-03-04 16:24:28,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:28,873 INFO L93 Difference]: Finished difference Result 77 states and 245 transitions. [2019-03-04 16:24:28,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:28,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:28,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:28,875 INFO L225 Difference]: With dead ends: 77 [2019-03-04 16:24:28,875 INFO L226 Difference]: Without dead ends: 76 [2019-03-04 16:24:28,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:28,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-03-04 16:24:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 49. [2019-03-04 16:24:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-03-04 16:24:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 200 transitions. [2019-03-04 16:24:28,886 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 200 transitions. Word has length 5 [2019-03-04 16:24:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:28,886 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 200 transitions. [2019-03-04 16:24:28,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 200 transitions. [2019-03-04 16:24:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:28,886 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:28,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:28,887 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:28,887 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-03-04 16:24:28,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:28,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:28,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:28,982 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:24:28,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:28,983 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:28,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:29,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:29,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:29,050 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 18 treesize of output 21 [2019-03-04 16:24:29,216 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 21 treesize of output 26 [2019-03-04 16:24:29,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,258 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:24:29,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,291 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:24:29,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,311 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:24:29,312 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,321 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,332 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,343 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,353 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,370 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:29,371 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:24:29,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,412 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:29,413 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,428 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:29,429 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:29,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:29,455 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:29,455 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:29,470 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:29,470 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:29,488 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:24:29,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:29,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:29,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:29,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:29,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:29,508 INFO L87 Difference]: Start difference. First operand 49 states and 200 transitions. Second operand 8 states. [2019-03-04 16:24:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:29,796 INFO L93 Difference]: Finished difference Result 67 states and 221 transitions. [2019-03-04 16:24:29,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:29,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:29,798 INFO L225 Difference]: With dead ends: 67 [2019-03-04 16:24:29,798 INFO L226 Difference]: Without dead ends: 66 [2019-03-04 16:24:29,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-03-04 16:24:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 49. [2019-03-04 16:24:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-03-04 16:24:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 200 transitions. [2019-03-04 16:24:29,809 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 200 transitions. Word has length 5 [2019-03-04 16:24:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:29,809 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 200 transitions. [2019-03-04 16:24:29,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 200 transitions. [2019-03-04 16:24:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:29,810 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:29,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:29,810 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:29,810 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-03-04 16:24:29,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:29,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:29,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:29,967 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:24:29,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:29,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:29,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:29,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:29,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:29,998 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 18 treesize of output 21 [2019-03-04 16:24:30,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,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 21 treesize of output 23 [2019-03-04 16:24:30,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,011 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 23 treesize of output 25 [2019-03-04 16:24:30,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,021 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 25 treesize of output 27 [2019-03-04 16:24:30,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,046 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:30,046 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,057 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,079 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,091 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,102 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,120 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:30,120 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:30,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,155 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:30,156 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,176 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:30,176 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:30,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:30,440 INFO L301 Elim1Store]: Index analysis took 208 ms [2019-03-04 16:24:30,441 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:30,441 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:30,693 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:30,693 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:30,922 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-03-04 16:24:30,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:31,194 INFO L301 Elim1Store]: Index analysis took 244 ms [2019-03-04 16:24:31,195 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:31,196 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:31,374 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:31,374 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:24:31,408 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:24:31,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:31,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:31,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:31,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:31,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:31,428 INFO L87 Difference]: Start difference. First operand 49 states and 200 transitions. Second operand 10 states. [2019-03-04 16:24:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:32,184 INFO L93 Difference]: Finished difference Result 80 states and 254 transitions. [2019-03-04 16:24:32,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:32,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:32,186 INFO L225 Difference]: With dead ends: 80 [2019-03-04 16:24:32,186 INFO L226 Difference]: Without dead ends: 79 [2019-03-04 16:24:32,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-03-04 16:24:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 47. [2019-03-04 16:24:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-03-04 16:24:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 188 transitions. [2019-03-04 16:24:32,197 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 188 transitions. Word has length 5 [2019-03-04 16:24:32,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:32,197 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 188 transitions. [2019-03-04 16:24:32,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 188 transitions. [2019-03-04 16:24:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:32,198 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:32,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:32,198 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:32,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:32,198 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-03-04 16:24:32,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:32,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:32,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:32,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:32,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:32,314 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:24:32,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:32,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:32,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:32,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:32,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:32,332 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 18 treesize of output 21 [2019-03-04 16:24:32,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,336 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 21 treesize of output 23 [2019-03-04 16:24:32,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,344 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 23 treesize of output 25 [2019-03-04 16:24:32,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,354 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 25 treesize of output 27 [2019-03-04 16:24:32,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:32,384 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,394 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,405 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,415 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,464 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:32,500 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:32,500 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:32,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:32,796 INFO L301 Elim1Store]: Index analysis took 244 ms [2019-03-04 16:24:32,797 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:32,798 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,061 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:33,062 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:33,296 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-03-04 16:24:33,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:33,556 INFO L301 Elim1Store]: Index analysis took 233 ms [2019-03-04 16:24:33,557 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:33,558 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:33,800 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:33,800 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:34,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:34,166 INFO L301 Elim1Store]: Index analysis took 131 ms [2019-03-04 16:24:34,166 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:34,167 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:34,186 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:34,186 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:34,204 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:24:34,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:34,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:34,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:34,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:34,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:34,224 INFO L87 Difference]: Start difference. First operand 47 states and 188 transitions. Second operand 10 states. [2019-03-04 16:24:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:34,782 INFO L93 Difference]: Finished difference Result 92 states and 259 transitions. [2019-03-04 16:24:34,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:34,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:34,784 INFO L225 Difference]: With dead ends: 92 [2019-03-04 16:24:34,784 INFO L226 Difference]: Without dead ends: 90 [2019-03-04 16:24:34,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-03-04 16:24:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 48. [2019-03-04 16:24:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-03-04 16:24:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 194 transitions. [2019-03-04 16:24:34,800 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 194 transitions. Word has length 5 [2019-03-04 16:24:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:34,800 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 194 transitions. [2019-03-04 16:24:34,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 194 transitions. [2019-03-04 16:24:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:34,801 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:34,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:34,801 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:34,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:34,801 INFO L82 PathProgramCache]: Analyzing trace with hash 29242726, now seen corresponding path program 1 times [2019-03-04 16:24:34,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:34,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:34,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:34,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:34,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:34,966 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-03-04 16:24:35,032 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:24:35,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:35,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:35,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:35,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:35,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:35,055 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 18 treesize of output 21 [2019-03-04 16:24:35,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,065 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 21 treesize of output 23 [2019-03-04 16:24:35,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,078 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 23 treesize of output 25 [2019-03-04 16:24:35,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,088 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 25 treesize of output 27 [2019-03-04 16:24:35,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,191 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:35,191 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,202 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,212 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,222 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,232 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,268 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:35,268 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:35,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,304 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:35,305 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,323 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:35,323 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:35,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,358 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:35,358 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,376 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:35,377 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:35,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:35,409 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:35,409 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:35,453 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:35,454 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:35,487 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:24:35,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:35,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:35,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:35,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:35,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:35,507 INFO L87 Difference]: Start difference. First operand 48 states and 194 transitions. Second operand 10 states. [2019-03-04 16:24:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:36,252 INFO L93 Difference]: Finished difference Result 82 states and 246 transitions. [2019-03-04 16:24:36,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:36,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:36,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:36,254 INFO L225 Difference]: With dead ends: 82 [2019-03-04 16:24:36,254 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:24:36,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:24:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 53. [2019-03-04 16:24:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-03-04 16:24:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 214 transitions. [2019-03-04 16:24:36,267 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 214 transitions. Word has length 5 [2019-03-04 16:24:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:36,268 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 214 transitions. [2019-03-04 16:24:36,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 214 transitions. [2019-03-04 16:24:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:36,268 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:36,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:36,269 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:36,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:36,269 INFO L82 PathProgramCache]: Analyzing trace with hash 29231318, now seen corresponding path program 2 times [2019-03-04 16:24:36,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:36,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:36,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:36,439 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-03-04 16:24:36,477 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:24:36,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:36,478 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:36,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:36,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:36,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:36,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:36,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:36,499 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 18 treesize of output 21 [2019-03-04 16:24:36,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,503 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 21 treesize of output 23 [2019-03-04 16:24:36,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,510 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 23 treesize of output 25 [2019-03-04 16:24:36,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,521 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 25 treesize of output 27 [2019-03-04 16:24:36,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,534 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:36,535 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,545 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,556 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,566 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,575 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,594 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:36,594 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:36,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,623 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:36,623 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,643 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:36,643 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:36,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,695 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:36,695 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,713 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:36,714 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:36,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:36,746 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:36,747 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:36,858 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:36,858 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:36,966 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:24:36,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:36,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:36,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:36,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:36,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:36,986 INFO L87 Difference]: Start difference. First operand 53 states and 214 transitions. Second operand 10 states. [2019-03-04 16:24:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:37,727 INFO L93 Difference]: Finished difference Result 93 states and 270 transitions. [2019-03-04 16:24:37,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:24:37,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:37,729 INFO L225 Difference]: With dead ends: 93 [2019-03-04 16:24:37,729 INFO L226 Difference]: Without dead ends: 91 [2019-03-04 16:24:37,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:37,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-03-04 16:24:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 52. [2019-03-04 16:24:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:24:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 203 transitions. [2019-03-04 16:24:37,743 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 203 transitions. Word has length 5 [2019-03-04 16:24:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:37,743 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 203 transitions. [2019-03-04 16:24:37,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 203 transitions. [2019-03-04 16:24:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:37,744 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:37,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:37,744 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:37,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:37,745 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-03-04 16:24:37,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:37,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:37,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:37,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:37,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:37,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:37,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:37,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:37,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:37,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:37,884 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 18 treesize of output 21 [2019-03-04 16:24:37,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,891 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 21 treesize of output 23 [2019-03-04 16:24:37,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,899 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 23 treesize of output 25 [2019-03-04 16:24:37,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,061 INFO L301 Elim1Store]: Index analysis took 126 ms [2019-03-04 16:24:38,062 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 25 treesize of output 27 [2019-03-04 16:24:38,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,225 INFO L301 Elim1Store]: Index analysis took 131 ms [2019-03-04 16:24:38,225 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:38,226 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,277 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,291 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,304 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,318 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,339 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:38,339 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:38,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,387 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:38,387 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,403 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:38,404 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:38,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:38,448 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:38,448 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,468 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:38,468 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:38,487 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:24:38,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:38,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:38,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:38,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:38,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:38,506 INFO L87 Difference]: Start difference. First operand 52 states and 203 transitions. Second operand 8 states. [2019-03-04 16:24:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:38,846 INFO L93 Difference]: Finished difference Result 73 states and 241 transitions. [2019-03-04 16:24:38,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:38,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:38,848 INFO L225 Difference]: With dead ends: 73 [2019-03-04 16:24:38,848 INFO L226 Difference]: Without dead ends: 72 [2019-03-04 16:24:38,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:38,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-03-04 16:24:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2019-03-04 16:24:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-03-04 16:24:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 225 transitions. [2019-03-04 16:24:38,867 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 225 transitions. Word has length 5 [2019-03-04 16:24:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:38,867 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 225 transitions. [2019-03-04 16:24:38,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 225 transitions. [2019-03-04 16:24:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:38,868 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:38,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:38,868 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:38,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:38,869 INFO L82 PathProgramCache]: Analyzing trace with hash 29234790, now seen corresponding path program 1 times [2019-03-04 16:24:38,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:38,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:38,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:38,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:38,985 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:24:38,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:38,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:38,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:39,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:39,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:39,005 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 18 treesize of output 21 [2019-03-04 16:24:39,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,009 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 21 treesize of output 23 [2019-03-04 16:24:39,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,021 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 23 treesize of output 25 [2019-03-04 16:24:39,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,032 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 25 treesize of output 27 [2019-03-04 16:24:39,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,048 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:39,048 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,058 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,069 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,079 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,088 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,105 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:39,106 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:39,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,186 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:39,186 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,206 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:39,206 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:39,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,240 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:39,241 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,257 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:39,257 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:39,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,299 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:39,300 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,319 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:39,320 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:39,375 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:24:39,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:39,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:39,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:39,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:39,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:39,395 INFO L87 Difference]: Start difference. First operand 55 states and 225 transitions. Second operand 10 states. [2019-03-04 16:24:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:40,056 INFO L93 Difference]: Finished difference Result 105 states and 317 transitions. [2019-03-04 16:24:40,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:40,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:40,058 INFO L225 Difference]: With dead ends: 105 [2019-03-04 16:24:40,058 INFO L226 Difference]: Without dead ends: 104 [2019-03-04 16:24:40,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-03-04 16:24:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2019-03-04 16:24:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-03-04 16:24:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 249 transitions. [2019-03-04 16:24:40,080 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 249 transitions. Word has length 5 [2019-03-04 16:24:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:40,080 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 249 transitions. [2019-03-04 16:24:40,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 249 transitions. [2019-03-04 16:24:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:40,081 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:40,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:40,081 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash 29235350, now seen corresponding path program 1 times [2019-03-04 16:24:40,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:40,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:40,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:40,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:40,281 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-03-04 16:24:40,289 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:24:40,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:40,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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:24:40,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:40,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:40,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:40,311 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 18 treesize of output 21 [2019-03-04 16:24:40,350 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 21 treesize of output 26 [2019-03-04 16:24:40,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,369 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:24:40,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,406 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:24:40,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,438 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:24:40,439 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,447 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,458 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,468 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,478 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,493 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:40,493 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:24:40,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,525 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:40,525 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,540 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:40,540 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:40,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,565 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:40,566 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,580 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:40,581 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:40,594 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:24:40,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:40,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:40,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:40,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:40,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:40,615 INFO L87 Difference]: Start difference. First operand 59 states and 249 transitions. Second operand 8 states. [2019-03-04 16:24:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:40,989 INFO L93 Difference]: Finished difference Result 89 states and 296 transitions. [2019-03-04 16:24:40,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:40,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:40,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:40,992 INFO L225 Difference]: With dead ends: 89 [2019-03-04 16:24:40,992 INFO L226 Difference]: Without dead ends: 88 [2019-03-04 16:24:40,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-03-04 16:24:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 59. [2019-03-04 16:24:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-03-04 16:24:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 249 transitions. [2019-03-04 16:24:41,018 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 249 transitions. Word has length 5 [2019-03-04 16:24:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:41,018 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 249 transitions. [2019-03-04 16:24:41,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 249 transitions. [2019-03-04 16:24:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:41,019 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:41,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:41,019 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:41,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:41,019 INFO L82 PathProgramCache]: Analyzing trace with hash 29235038, now seen corresponding path program 1 times [2019-03-04 16:24:41,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:41,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:41,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:41,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:41,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:41,311 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-03-04 16:24:41,374 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:24:41,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:41,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:41,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:41,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:41,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:41,393 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 18 treesize of output 21 [2019-03-04 16:24:41,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,441 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 21 treesize of output 23 [2019-03-04 16:24:41,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,446 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 23 treesize of output 25 [2019-03-04 16:24:41,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,456 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 25 treesize of output 27 [2019-03-04 16:24:41,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,472 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:41,472 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,482 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,493 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,503 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,513 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,532 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,532 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:41,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,567 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:41,567 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,586 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,587 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:41,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,621 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:41,621 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,641 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,641 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:41,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,710 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:41,711 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,729 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,729 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:41,763 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:24:41,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:41,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:41,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:41,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:41,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:41,783 INFO L87 Difference]: Start difference. First operand 59 states and 249 transitions. Second operand 10 states. [2019-03-04 16:24:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:42,593 INFO L93 Difference]: Finished difference Result 99 states and 332 transitions. [2019-03-04 16:24:42,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:42,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:42,595 INFO L225 Difference]: With dead ends: 99 [2019-03-04 16:24:42,595 INFO L226 Difference]: Without dead ends: 97 [2019-03-04 16:24:42,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-03-04 16:24:42,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2019-03-04 16:24:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-03-04 16:24:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 297 transitions. [2019-03-04 16:24:42,616 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 297 transitions. Word has length 5 [2019-03-04 16:24:42,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:42,617 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 297 transitions. [2019-03-04 16:24:42,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 297 transitions. [2019-03-04 16:24:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:42,617 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:42,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:42,618 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:42,618 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-03-04 16:24:42,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:42,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:42,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:42,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:42,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:42,760 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:24:42,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:42,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:42,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:42,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:42,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:42,779 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 18 treesize of output 21 [2019-03-04 16:24:42,797 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 21 treesize of output 26 [2019-03-04 16:24:42,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,809 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:24:42,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,826 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:24:42,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,847 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:24:42,847 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,857 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,867 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,878 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,888 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,904 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:42,905 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:24:42,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,940 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:42,941 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,955 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:42,956 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:42,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:42,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:43,000 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,015 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:43,015 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:43,030 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:24:43,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:43,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:43,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:43,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:43,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:43,051 INFO L87 Difference]: Start difference. First operand 67 states and 297 transitions. Second operand 8 states. [2019-03-04 16:24:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:43,322 INFO L93 Difference]: Finished difference Result 90 states and 324 transitions. [2019-03-04 16:24:43,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:43,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:43,323 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:24:43,324 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:24:43,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:24:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2019-03-04 16:24:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-03-04 16:24:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 297 transitions. [2019-03-04 16:24:43,345 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 297 transitions. Word has length 5 [2019-03-04 16:24:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:43,345 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 297 transitions. [2019-03-04 16:24:43,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 297 transitions. [2019-03-04 16:24:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:43,346 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:43,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:43,346 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:43,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:43,346 INFO L82 PathProgramCache]: Analyzing trace with hash 28825528, now seen corresponding path program 2 times [2019-03-04 16:24:43,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:43,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:43,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:43,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:43,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:43,550 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:24:43,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:43,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:43,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:43,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:43,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:43,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:43,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:43,577 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 18 treesize of output 21 [2019-03-04 16:24:43,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,581 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 21 treesize of output 23 [2019-03-04 16:24:43,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,589 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 23 treesize of output 25 [2019-03-04 16:24:43,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,600 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 25 treesize of output 27 [2019-03-04 16:24:43,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,616 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:43,616 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,626 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,635 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,644 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,654 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,673 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:43,674 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:43,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,710 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:43,711 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,730 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:43,730 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:43,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,764 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:43,765 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,793 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:43,793 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:43,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,826 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:43,827 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,846 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:43,847 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:24:43,873 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:24:43,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:43,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:43,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:43,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:43,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:43,893 INFO L87 Difference]: Start difference. First operand 67 states and 297 transitions. Second operand 10 states. [2019-03-04 16:24:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:44,543 INFO L93 Difference]: Finished difference Result 114 states and 370 transitions. [2019-03-04 16:24:44,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:44,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:44,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:44,545 INFO L225 Difference]: With dead ends: 114 [2019-03-04 16:24:44,545 INFO L226 Difference]: Without dead ends: 112 [2019-03-04 16:24:44,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-03-04 16:24:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 64. [2019-03-04 16:24:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-03-04 16:24:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 278 transitions. [2019-03-04 16:24:44,566 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 278 transitions. Word has length 5 [2019-03-04 16:24:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:44,566 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 278 transitions. [2019-03-04 16:24:44,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 278 transitions. [2019-03-04 16:24:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:44,567 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:44,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:44,567 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:44,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash 28831794, now seen corresponding path program 1 times [2019-03-04 16:24:44,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:44,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:44,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:44,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:44,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:44,858 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-03-04 16:24:45,021 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 5 [2019-03-04 16:24:45,022 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:24:45,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:45,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:45,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:45,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:45,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:45,088 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 18 treesize of output 21 [2019-03-04 16:24:45,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,134 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 21 treesize of output 23 [2019-03-04 16:24:45,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,158 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 23 treesize of output 25 [2019-03-04 16:24:45,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,168 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 25 treesize of output 27 [2019-03-04 16:24:45,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,186 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:45,187 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,197 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,208 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,218 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,228 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,248 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:45,248 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:45,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,277 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:45,278 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,298 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:45,298 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:45,316 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:24:45,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:45,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:45,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:45,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:45,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:45,335 INFO L87 Difference]: Start difference. First operand 64 states and 278 transitions. Second operand 6 states. [2019-03-04 16:24:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:45,517 INFO L93 Difference]: Finished difference Result 76 states and 289 transitions. [2019-03-04 16:24:45,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:45,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:24:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:45,519 INFO L225 Difference]: With dead ends: 76 [2019-03-04 16:24:45,519 INFO L226 Difference]: Without dead ends: 75 [2019-03-04 16:24:45,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-03-04 16:24:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2019-03-04 16:24:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-03-04 16:24:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 278 transitions. [2019-03-04 16:24:45,540 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 278 transitions. Word has length 5 [2019-03-04 16:24:45,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:45,540 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 278 transitions. [2019-03-04 16:24:45,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:45,540 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 278 transitions. [2019-03-04 16:24:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:45,541 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:45,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:45,541 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:45,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:45,541 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-03-04 16:24:45,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:45,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:45,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:45,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:45,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:45,820 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-03-04 16:24:46,105 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:24:46,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:46,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:46,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:46,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:46,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:46,172 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 18 treesize of output 21 [2019-03-04 16:24:46,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,195 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 21 treesize of output 23 [2019-03-04 16:24:46,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,200 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 23 treesize of output 25 [2019-03-04 16:24:46,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,209 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 25 treesize of output 27 [2019-03-04 16:24:46,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,224 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:46,225 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,235 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,246 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,255 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,265 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,285 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:46,285 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:46,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,314 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:46,315 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,332 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:46,332 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:46,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,363 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:46,363 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,379 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:46,379 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:46,396 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:24:46,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:46,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:46,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:46,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:46,414 INFO L87 Difference]: Start difference. First operand 64 states and 278 transitions. Second operand 8 states. [2019-03-04 16:24:46,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:46,643 INFO L93 Difference]: Finished difference Result 89 states and 316 transitions. [2019-03-04 16:24:46,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:46,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:46,644 INFO L225 Difference]: With dead ends: 89 [2019-03-04 16:24:46,644 INFO L226 Difference]: Without dead ends: 88 [2019-03-04 16:24:46,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-03-04 16:24:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2019-03-04 16:24:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-03-04 16:24:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 290 transitions. [2019-03-04 16:24:46,671 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 290 transitions. Word has length 5 [2019-03-04 16:24:46,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:46,671 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 290 transitions. [2019-03-04 16:24:46,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 290 transitions. [2019-03-04 16:24:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:46,672 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:46,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:46,672 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:46,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:46,673 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-03-04 16:24:46,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:46,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:46,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:46,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:47,186 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-03-04 16:24:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:47,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:47,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:47,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:47,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:47,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:47,365 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 18 treesize of output 21 [2019-03-04 16:24:47,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,368 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 21 treesize of output 23 [2019-03-04 16:24:47,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,375 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 23 treesize of output 25 [2019-03-04 16:24:47,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,385 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 25 treesize of output 27 [2019-03-04 16:24:47,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,401 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:47,401 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,410 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,421 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,431 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,439 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,458 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:47,459 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:47,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,497 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:47,498 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,517 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:47,518 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:47,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,551 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:47,551 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,573 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:47,573 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:47,594 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:24:47,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:47,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:47,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:47,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:47,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:47,614 INFO L87 Difference]: Start difference. First operand 66 states and 290 transitions. Second operand 8 states. [2019-03-04 16:24:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:47,982 INFO L93 Difference]: Finished difference Result 95 states and 333 transitions. [2019-03-04 16:24:47,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:47,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:47,985 INFO L225 Difference]: With dead ends: 95 [2019-03-04 16:24:47,985 INFO L226 Difference]: Without dead ends: 94 [2019-03-04 16:24:47,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-03-04 16:24:48,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2019-03-04 16:24:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-03-04 16:24:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 302 transitions. [2019-03-04 16:24:48,013 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 302 transitions. Word has length 5 [2019-03-04 16:24:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:48,013 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 302 transitions. [2019-03-04 16:24:48,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 302 transitions. [2019-03-04 16:24:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:48,013 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:48,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:48,014 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:48,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:48,014 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-03-04 16:24:48,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:48,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:48,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:48,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:48,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:48,120 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:24:48,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:48,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:48,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:48,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:48,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:48,138 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 18 treesize of output 21 [2019-03-04 16:24:48,147 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 21 treesize of output 26 [2019-03-04 16:24:48,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,238 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:24:48,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,254 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:24:48,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,273 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:24:48,274 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,283 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,299 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,318 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,328 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,350 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:48,351 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:24:48,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,398 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:48,399 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,416 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:48,416 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:48,442 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:24:48,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:48,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:48,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:48,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:48,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:48,466 INFO L87 Difference]: Start difference. First operand 68 states and 302 transitions. Second operand 6 states. [2019-03-04 16:24:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:48,702 INFO L93 Difference]: Finished difference Result 81 states and 314 transitions. [2019-03-04 16:24:48,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:48,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:24:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:48,703 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:24:48,703 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:24:48,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:24:48,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2019-03-04 16:24:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-03-04 16:24:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 302 transitions. [2019-03-04 16:24:48,736 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 302 transitions. Word has length 5 [2019-03-04 16:24:48,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:48,736 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 302 transitions. [2019-03-04 16:24:48,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 302 transitions. [2019-03-04 16:24:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:48,737 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:48,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:48,737 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:48,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:48,737 INFO L82 PathProgramCache]: Analyzing trace with hash 29052324, now seen corresponding path program 1 times [2019-03-04 16:24:48,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:48,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:48,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:48,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:48,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:49,260 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-03-04 16:24:49,376 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:24:49,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:49,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:49,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:49,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:49,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:49,393 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 18 treesize of output 21 [2019-03-04 16:24:49,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,397 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 21 treesize of output 23 [2019-03-04 16:24:49,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,404 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 23 treesize of output 25 [2019-03-04 16:24:49,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,460 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 25 treesize of output 27 [2019-03-04 16:24:49,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,473 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:49,474 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:49,484 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:49,494 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:49,505 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:49,515 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:49,534 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:49,534 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:49,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:49,568 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:49,586 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:49,586 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:49,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,619 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:49,620 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:49,637 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:49,637 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:24:49,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:49,723 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:49,723 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:49,743 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:49,743 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:49,765 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:24:49,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:49,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:49,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:49,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:49,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:49,785 INFO L87 Difference]: Start difference. First operand 68 states and 302 transitions. Second operand 10 states. [2019-03-04 16:24:50,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:50,429 INFO L93 Difference]: Finished difference Result 122 states and 387 transitions. [2019-03-04 16:24:50,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:50,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:50,431 INFO L225 Difference]: With dead ends: 122 [2019-03-04 16:24:50,431 INFO L226 Difference]: Without dead ends: 121 [2019-03-04 16:24:50,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-03-04 16:24:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 70. [2019-03-04 16:24:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-03-04 16:24:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 314 transitions. [2019-03-04 16:24:50,454 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 314 transitions. Word has length 5 [2019-03-04 16:24:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:50,455 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 314 transitions. [2019-03-04 16:24:50,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 314 transitions. [2019-03-04 16:24:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:50,455 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:50,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:50,456 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:50,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:50,456 INFO L82 PathProgramCache]: Analyzing trace with hash 29070122, now seen corresponding path program 1 times [2019-03-04 16:24:50,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:50,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:50,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:50,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:50,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:50,476 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:24:50,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:50,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:50,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:50,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:24:50,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:50,497 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 18 treesize of output 21 [2019-03-04 16:24:50,518 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 21 treesize of output 26 [2019-03-04 16:24:50,537 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:24:50,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,556 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:24:50,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,587 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:24:50,588 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,598 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,608 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,618 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,627 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,642 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:50,642 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:25, output treesize:32 [2019-03-04 16:24:50,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,662 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:50,662 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,671 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:50,672 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:24:50,682 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:24:50,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:50,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:50,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:50,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:50,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:50,701 INFO L87 Difference]: Start difference. First operand 70 states and 314 transitions. Second operand 6 states. [2019-03-04 16:24:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:50,829 INFO L93 Difference]: Finished difference Result 90 states and 369 transitions. [2019-03-04 16:24:50,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:50,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:24:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:50,831 INFO L225 Difference]: With dead ends: 90 [2019-03-04 16:24:50,831 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:24:50,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:50,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:24:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2019-03-04 16:24:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-03-04 16:24:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 356 transitions. [2019-03-04 16:24:50,868 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 356 transitions. Word has length 5 [2019-03-04 16:24:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:50,868 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 356 transitions. [2019-03-04 16:24:50,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 356 transitions. [2019-03-04 16:24:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:50,868 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:50,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:50,869 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2019-03-04 16:24:50,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:50,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:50,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:50,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:50,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:50,934 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:24:50,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:50,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:50,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:50,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:50,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:50,953 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 18 treesize of output 21 [2019-03-04 16:24:50,967 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 21 treesize of output 26 [2019-03-04 16:24:50,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,987 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:24:50,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:50,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,010 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:24:51,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,030 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:24:51,031 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,039 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,050 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,060 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,070 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,086 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:51,087 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:24:51,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,120 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:51,120 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,156 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:51,156 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:24:51,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,178 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:51,179 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,194 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:51,194 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:51,207 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:24:51,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:51,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:51,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:51,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:51,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:51,225 INFO L87 Difference]: Start difference. First operand 76 states and 356 transitions. Second operand 8 states. [2019-03-04 16:24:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:51,542 INFO L93 Difference]: Finished difference Result 108 states and 405 transitions. [2019-03-04 16:24:51,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:51,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:51,544 INFO L225 Difference]: With dead ends: 108 [2019-03-04 16:24:51,544 INFO L226 Difference]: Without dead ends: 107 [2019-03-04 16:24:51,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-03-04 16:24:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2019-03-04 16:24:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-03-04 16:24:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-03-04 16:24:51,581 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 5 [2019-03-04 16:24:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:51,581 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-03-04 16:24:51,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-03-04 16:24:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:51,582 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:51,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:51,583 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:51,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:51,583 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-03-04 16:24:51,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:51,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:51,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:51,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:51,746 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:24:51,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:51,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:51,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:51,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:51,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:51,780 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 18 treesize of output 21 [2019-03-04 16:24:51,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,786 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 21 treesize of output 23 [2019-03-04 16:24:51,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,796 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 23 treesize of output 25 [2019-03-04 16:24:51,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,808 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 25 treesize of output 27 [2019-03-04 16:24:51,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,827 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:51,827 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,838 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,848 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,859 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,869 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,888 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:51,889 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:51,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,924 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:51,925 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,953 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:51,953 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:51,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,986 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:51,986 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,006 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:52,006 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:52,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,040 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:52,040 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,060 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:52,060 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:52,079 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:24:52,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:52,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:52,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:52,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:52,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:52,098 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 10 states. [2019-03-04 16:24:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:52,652 INFO L93 Difference]: Finished difference Result 110 states and 412 transitions. [2019-03-04 16:24:52,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:52,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:24:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:52,653 INFO L225 Difference]: With dead ends: 110 [2019-03-04 16:24:52,653 INFO L226 Difference]: Without dead ends: 109 [2019-03-04 16:24:52,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-03-04 16:24:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 78. [2019-03-04 16:24:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-03-04 16:24:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 368 transitions. [2019-03-04 16:24:52,686 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 368 transitions. Word has length 6 [2019-03-04 16:24:52,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:52,686 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 368 transitions. [2019-03-04 16:24:52,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 368 transitions. [2019-03-04 16:24:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:52,687 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:52,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:52,687 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:52,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:52,688 INFO L82 PathProgramCache]: Analyzing trace with hash 904728978, now seen corresponding path program 1 times [2019-03-04 16:24:52,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:52,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:52,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:52,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:52,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:52,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:52,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:52,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:52,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:24:52,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:52,907 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 18 treesize of output 21 [2019-03-04 16:24:52,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,946 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 21 treesize of output 23 [2019-03-04 16:24:52,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,964 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 23 treesize of output 25 [2019-03-04 16:24:52,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,983 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 25 treesize of output 27 [2019-03-04 16:24:52,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:52,996 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:52,997 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,007 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,017 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,027 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,037 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,056 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:53,057 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:53,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,096 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:53,097 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,116 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:53,116 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:53,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,149 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:53,149 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,169 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:53,169 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:53,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,207 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:53,208 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,227 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:53,227 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:53,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:53,265 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:53,265 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,286 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:53,287 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:24:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:53,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:53,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:24:53,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:24:53,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:24:53,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:53,330 INFO L87 Difference]: Start difference. First operand 78 states and 368 transitions. Second operand 12 states. [2019-03-04 16:24:54,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:54,280 INFO L93 Difference]: Finished difference Result 142 states and 483 transitions. [2019-03-04 16:24:54,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:24:54,280 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:24:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:54,282 INFO L225 Difference]: With dead ends: 142 [2019-03-04 16:24:54,283 INFO L226 Difference]: Without dead ends: 141 [2019-03-04 16:24:54,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:24:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-03-04 16:24:54,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 80. [2019-03-04 16:24:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-03-04 16:24:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 380 transitions. [2019-03-04 16:24:54,312 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 380 transitions. Word has length 6 [2019-03-04 16:24:54,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:54,312 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 380 transitions. [2019-03-04 16:24:54,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:24:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 380 transitions. [2019-03-04 16:24:54,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:54,313 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:54,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:54,313 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:54,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:54,313 INFO L82 PathProgramCache]: Analyzing trace with hash 904746776, now seen corresponding path program 1 times [2019-03-04 16:24:54,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:54,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:54,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:54,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:54,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:54,382 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:24:54,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:54,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:54,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:54,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:54,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:54,399 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 18 treesize of output 21 [2019-03-04 16:24:54,414 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 21 treesize of output 26 [2019-03-04 16:24:54,435 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:24:54,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:54,460 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:24:54,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:54,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:54,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:54,485 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:24:54,486 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:54,496 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:54,519 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:54,530 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:54,538 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:54,553 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:54,553 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-03-04 16:24:54,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:54,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:54,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:54,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:24:54,584 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:54,593 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:54,594 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:24:54,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:54,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:54,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:54,613 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:24:54,614 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:54,624 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:54,624 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:24:54,640 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:24:54,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:54,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:54,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:54,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:54,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:54,660 INFO L87 Difference]: Start difference. First operand 80 states and 380 transitions. Second operand 8 states. [2019-03-04 16:24:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:54,943 INFO L93 Difference]: Finished difference Result 100 states and 403 transitions. [2019-03-04 16:24:54,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:54,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:24:54,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:54,945 INFO L225 Difference]: With dead ends: 100 [2019-03-04 16:24:54,945 INFO L226 Difference]: Without dead ends: 99 [2019-03-04 16:24:54,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-03-04 16:24:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2019-03-04 16:24:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-03-04 16:24:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 374 transitions. [2019-03-04 16:24:54,975 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 374 transitions. Word has length 6 [2019-03-04 16:24:54,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:54,975 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 374 transitions. [2019-03-04 16:24:54,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 374 transitions. [2019-03-04 16:24:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:54,976 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:54,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:54,976 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:54,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:54,976 INFO L82 PathProgramCache]: Analyzing trace with hash 904733258, now seen corresponding path program 1 times [2019-03-04 16:24:54,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:54,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:54,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:54,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:54,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:55,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:55,081 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:55,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:55,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:55,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:24:55,116 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 21 treesize of output 26 [2019-03-04 16:24:55,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,140 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:24:55,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,154 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:24:55,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,173 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:24:55,174 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,182 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,192 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,202 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,212 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,228 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:55,228 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:24:55,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,266 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:55,266 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,278 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:55,279 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:55,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,301 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:55,301 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,315 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:55,316 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:55,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,340 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:55,340 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,353 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:55,353 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:24:55,369 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:24:55,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:55,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:55,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:55,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:55,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:55,390 INFO L87 Difference]: Start difference. First operand 79 states and 374 transitions. Second operand 10 states. [2019-03-04 16:24:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:55,786 INFO L93 Difference]: Finished difference Result 114 states and 441 transitions. [2019-03-04 16:24:55,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:55,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:24:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:55,788 INFO L225 Difference]: With dead ends: 114 [2019-03-04 16:24:55,788 INFO L226 Difference]: Without dead ends: 113 [2019-03-04 16:24:55,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-03-04 16:24:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 83. [2019-03-04 16:24:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-03-04 16:24:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 399 transitions. [2019-03-04 16:24:55,828 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 399 transitions. Word has length 6 [2019-03-04 16:24:55,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:55,828 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 399 transitions. [2019-03-04 16:24:55,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:55,829 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 399 transitions. [2019-03-04 16:24:55,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:55,829 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:55,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:55,830 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:55,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:55,830 INFO L82 PathProgramCache]: Analyzing trace with hash 904732946, now seen corresponding path program 1 times [2019-03-04 16:24:55,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:55,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:55,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:55,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:55,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:55,971 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-03-04 16:24:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:56,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:56,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:56,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:56,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:24:56,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:56,103 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 18 treesize of output 21 [2019-03-04 16:24:56,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,107 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 21 treesize of output 23 [2019-03-04 16:24:56,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,113 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 23 treesize of output 25 [2019-03-04 16:24:56,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,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 25 treesize of output 27 [2019-03-04 16:24:56,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,139 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:56,139 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,149 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,159 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,169 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,179 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,196 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,196 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:56,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,243 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:56,244 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,263 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:56,263 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:56,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,298 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:56,298 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,317 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:56,317 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:56,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,357 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:56,357 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,376 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:56,376 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-03-04 16:24:56,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,418 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:24:56,418 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,444 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:56,445 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:24:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:56,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:56,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:24:56,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:24:56,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:24:56,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:56,506 INFO L87 Difference]: Start difference. First operand 83 states and 399 transitions. Second operand 12 states. [2019-03-04 16:24:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:57,509 INFO L93 Difference]: Finished difference Result 126 states and 470 transitions. [2019-03-04 16:24:57,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:57,509 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:24:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:57,511 INFO L225 Difference]: With dead ends: 126 [2019-03-04 16:24:57,511 INFO L226 Difference]: Without dead ends: 124 [2019-03-04 16:24:57,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:24:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-03-04 16:24:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 80. [2019-03-04 16:24:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-03-04 16:24:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 381 transitions. [2019-03-04 16:24:57,556 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 381 transitions. Word has length 6 [2019-03-04 16:24:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:57,557 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 381 transitions. [2019-03-04 16:24:57,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:24:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 381 transitions. [2019-03-04 16:24:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:57,557 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:57,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:57,558 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:57,558 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-03-04 16:24:57,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:57,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:57,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:57,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:57,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:57,948 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-03-04 16:24:58,012 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:24:58,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:58,013 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:58,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:58,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:58,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:58,035 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 18 treesize of output 21 [2019-03-04 16:24:58,050 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 21 treesize of output 26 [2019-03-04 16:24:58,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,069 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:24:58,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,085 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:24:58,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,104 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:24:58,104 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,112 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,122 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,133 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,143 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,159 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:58,159 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:24:58,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,200 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:58,200 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,213 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:58,213 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:24:58,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,241 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:58,241 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,275 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:58,275 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:58,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:58,302 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:24:58,302 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,317 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:58,317 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:24:58,335 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:24:58,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:58,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:58,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:58,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:58,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:58,353 INFO L87 Difference]: Start difference. First operand 80 states and 381 transitions. Second operand 10 states. [2019-03-04 16:24:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:58,891 INFO L93 Difference]: Finished difference Result 110 states and 414 transitions. [2019-03-04 16:24:58,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:58,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:24:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:58,893 INFO L225 Difference]: With dead ends: 110 [2019-03-04 16:24:58,893 INFO L226 Difference]: Without dead ends: 109 [2019-03-04 16:24:58,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-03-04 16:24:58,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 77. [2019-03-04 16:24:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-03-04 16:24:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 363 transitions. [2019-03-04 16:24:58,939 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 363 transitions. Word has length 6 [2019-03-04 16:24:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:58,939 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 363 transitions. [2019-03-04 16:24:58,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 363 transitions. [2019-03-04 16:24:58,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:58,940 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:58,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:58,940 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:58,940 INFO L82 PathProgramCache]: Analyzing trace with hash 904329702, now seen corresponding path program 1 times [2019-03-04 16:24:58,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:58,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:58,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:58,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:58,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:59,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:24:59,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:59,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:59,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:59,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:59,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:59,080 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 18 treesize of output 21 [2019-03-04 16:24:59,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,086 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 21 treesize of output 23 [2019-03-04 16:24:59,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,092 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 23 treesize of output 25 [2019-03-04 16:24:59,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,103 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 25 treesize of output 27 [2019-03-04 16:24:59,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,118 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:59,119 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,129 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,139 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,149 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,179 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,197 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:59,197 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:24:59,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,228 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:59,229 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,248 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:59,248 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:24:59,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,278 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:24:59,279 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,298 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:59,299 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:24:59,319 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:24:59,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:59,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:59,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:59,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:59,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:59,338 INFO L87 Difference]: Start difference. First operand 77 states and 363 transitions. Second operand 8 states. [2019-03-04 16:24:59,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:59,656 INFO L93 Difference]: Finished difference Result 98 states and 392 transitions. [2019-03-04 16:24:59,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:59,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:24:59,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:59,658 INFO L225 Difference]: With dead ends: 98 [2019-03-04 16:24:59,658 INFO L226 Difference]: Without dead ends: 97 [2019-03-04 16:24:59,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:59,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-03-04 16:24:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2019-03-04 16:24:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-03-04 16:24:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 369 transitions. [2019-03-04 16:24:59,705 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 369 transitions. Word has length 6 [2019-03-04 16:24:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:59,706 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 369 transitions. [2019-03-04 16:24:59,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 369 transitions. [2019-03-04 16:24:59,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:24:59,707 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:59,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:24:59,707 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:59,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:59,707 INFO L82 PathProgramCache]: Analyzing trace with hash 904316184, now seen corresponding path program 1 times [2019-03-04 16:24:59,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:59,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:59,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:59,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:59,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:59,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:59,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:59,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:59,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:59,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:59,842 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 18 treesize of output 21 [2019-03-04 16:24:59,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,846 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 21 treesize of output 23 [2019-03-04 16:24:59,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,852 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 23 treesize of output 25 [2019-03-04 16:24:59,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,862 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 25 treesize of output 27 [2019-03-04 16:24:59,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:59,877 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:59,877 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,019 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,055 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,065 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,075 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,094 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:00,094 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:00,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,127 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:00,127 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,147 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:00,147 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:00,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,180 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:00,180 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,198 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:00,198 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:00,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:00,233 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:00,233 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,253 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:00,253 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:25:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:00,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:00,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:00,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:00,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:00,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:00,298 INFO L87 Difference]: Start difference. First operand 78 states and 369 transitions. Second operand 10 states. [2019-03-04 16:25:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:00,798 INFO L93 Difference]: Finished difference Result 116 states and 423 transitions. [2019-03-04 16:25:00,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:00,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:00,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:00,800 INFO L225 Difference]: With dead ends: 116 [2019-03-04 16:25:00,800 INFO L226 Difference]: Without dead ends: 115 [2019-03-04 16:25:00,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-03-04 16:25:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 80. [2019-03-04 16:25:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-03-04 16:25:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 381 transitions. [2019-03-04 16:25:00,840 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 381 transitions. Word has length 6 [2019-03-04 16:25:00,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:00,840 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 381 transitions. [2019-03-04 16:25:00,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 381 transitions. [2019-03-04 16:25:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:00,841 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:00,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:00,841 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:00,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:00,841 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-03-04 16:25:00,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:00,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:00,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:00,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:00,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:01,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:01,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:25:01,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:01,016 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 18 treesize of output 21 [2019-03-04 16:25:01,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,018 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 21 treesize of output 23 [2019-03-04 16:25:01,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,024 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 23 treesize of output 25 [2019-03-04 16:25:01,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,035 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 25 treesize of output 27 [2019-03-04 16:25:01,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,057 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:01,058 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,071 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,080 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,091 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,102 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,118 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:01,118 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:01,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,153 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:01,154 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,173 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:01,173 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:01,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,205 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:01,206 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,224 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:01,224 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:01,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:01,257 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:01,257 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,277 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:01,277 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:01,299 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:25:01,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:01,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:01,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:01,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:01,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:01,320 INFO L87 Difference]: Start difference. First operand 80 states and 381 transitions. Second operand 10 states. [2019-03-04 16:25:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:01,882 INFO L93 Difference]: Finished difference Result 115 states and 444 transitions. [2019-03-04 16:25:01,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:01,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:01,884 INFO L225 Difference]: With dead ends: 115 [2019-03-04 16:25:01,884 INFO L226 Difference]: Without dead ends: 114 [2019-03-04 16:25:01,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:01,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-03-04 16:25:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 85. [2019-03-04 16:25:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-03-04 16:25:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 411 transitions. [2019-03-04 16:25:01,921 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 411 transitions. Word has length 6 [2019-03-04 16:25:01,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:01,922 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 411 transitions. [2019-03-04 16:25:01,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:01,922 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 411 transitions. [2019-03-04 16:25:01,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:01,922 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:01,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:01,923 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:01,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:01,923 INFO L82 PathProgramCache]: Analyzing trace with hash 904867926, now seen corresponding path program 1 times [2019-03-04 16:25:01,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:01,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:01,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:01,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:01,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:02,005 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:25:02,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:02,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:02,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:02,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:25:02,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:02,023 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 18 treesize of output 21 [2019-03-04 16:25:02,037 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 21 treesize of output 26 [2019-03-04 16:25:02,062 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:25:02,087 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:25:02,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,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, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 27 treesize of output 35 [2019-03-04 16:25:02,119 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,129 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,139 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,150 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,160 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,173 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:02,173 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:22, output treesize:29 [2019-03-04 16:25:02,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,192 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:25:02,192 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,198 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:02,198 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-03-04 16:25:02,208 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:25:02,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:02,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:25:02,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:25:02,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:25:02,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:02,228 INFO L87 Difference]: Start difference. First operand 85 states and 411 transitions. Second operand 6 states. [2019-03-04 16:25:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:02,348 INFO L93 Difference]: Finished difference Result 100 states and 456 transitions. [2019-03-04 16:25:02,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:25:02,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-03-04 16:25:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:02,350 INFO L225 Difference]: With dead ends: 100 [2019-03-04 16:25:02,350 INFO L226 Difference]: Without dead ends: 96 [2019-03-04 16:25:02,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-03-04 16:25:02,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-03-04 16:25:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-03-04 16:25:02,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 448 transitions. [2019-03-04 16:25:02,392 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 448 transitions. Word has length 6 [2019-03-04 16:25:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:02,392 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 448 transitions. [2019-03-04 16:25:02,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:25:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 448 transitions. [2019-03-04 16:25:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:02,393 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:02,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:02,393 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:02,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:02,393 INFO L82 PathProgramCache]: Analyzing trace with hash 904444958, now seen corresponding path program 2 times [2019-03-04 16:25:02,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:02,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:02,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:02,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:02,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:02,518 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:25:02,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:02,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:02,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:02,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:02,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:02,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:25:02,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:02,541 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 18 treesize of output 21 [2019-03-04 16:25:02,550 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 21 treesize of output 26 [2019-03-04 16:25:02,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,562 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:25:02,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,579 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:25:02,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,601 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:02,601 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,610 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,620 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,631 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,657 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,675 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:02,676 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:25:02,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,740 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:25:02,740 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,755 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:02,755 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:25:02,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,779 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:02,779 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,794 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:02,794 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:25:02,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:02,816 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:25:02,816 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:02,829 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:02,830 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:25:02,845 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:25:02,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:02,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:02,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:02,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:02,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:02,865 INFO L87 Difference]: Start difference. First operand 91 states and 448 transitions. Second operand 10 states. [2019-03-04 16:25:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:03,291 INFO L93 Difference]: Finished difference Result 131 states and 496 transitions. [2019-03-04 16:25:03,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:03,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:03,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:03,294 INFO L225 Difference]: With dead ends: 131 [2019-03-04 16:25:03,294 INFO L226 Difference]: Without dead ends: 127 [2019-03-04 16:25:03,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:03,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-03-04 16:25:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2019-03-04 16:25:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-03-04 16:25:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 444 transitions. [2019-03-04 16:25:03,339 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 444 transitions. Word has length 6 [2019-03-04 16:25:03,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:03,339 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 444 transitions. [2019-03-04 16:25:03,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 444 transitions. [2019-03-04 16:25:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:03,340 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:03,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:03,340 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:03,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:03,340 INFO L82 PathProgramCache]: Analyzing trace with hash 904448866, now seen corresponding path program 1 times [2019-03-04 16:25:03,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:03,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:03,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:03,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:03,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:03,421 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:25:03,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:03,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:03,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:03,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:25:03,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:03,443 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 18 treesize of output 21 [2019-03-04 16:25:03,461 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 21 treesize of output 26 [2019-03-04 16:25:03,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,477 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:25:03,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,492 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:25:03,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,512 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:03,513 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:03,521 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:03,532 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:03,542 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:03,553 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:03,568 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:03,569 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:25:03,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,609 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:25:03,609 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:03,624 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:03,625 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:25:03,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:03,652 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:03,653 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:03,682 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:03,682 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:25:03,708 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:25:03,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:03,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:03,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:03,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:03,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:03,727 INFO L87 Difference]: Start difference. First operand 92 states and 444 transitions. Second operand 8 states. [2019-03-04 16:25:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:04,095 INFO L93 Difference]: Finished difference Result 100 states and 451 transitions. [2019-03-04 16:25:04,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:04,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:25:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:04,097 INFO L225 Difference]: With dead ends: 100 [2019-03-04 16:25:04,097 INFO L226 Difference]: Without dead ends: 97 [2019-03-04 16:25:04,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-03-04 16:25:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2019-03-04 16:25:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-03-04 16:25:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 441 transitions. [2019-03-04 16:25:04,138 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 441 transitions. Word has length 6 [2019-03-04 16:25:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:04,138 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 441 transitions. [2019-03-04 16:25:04,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 441 transitions. [2019-03-04 16:25:04,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:04,139 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:04,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:04,139 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:04,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:04,139 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2019-03-04 16:25:04,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:04,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:04,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:04,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:04,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:04,306 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-03-04 16:25:04,353 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:25:04,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:04,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:04,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:04,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:25:04,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:04,383 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 18 treesize of output 21 [2019-03-04 16:25:04,395 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 21 treesize of output 26 [2019-03-04 16:25:04,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,406 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:25:04,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,423 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:25:04,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,440 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:04,440 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,450 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,460 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,471 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,481 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,497 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:04,498 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:25:04,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,537 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:25:04,538 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,551 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:04,552 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:25:04,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,653 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:04,654 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,666 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:04,666 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:25:04,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:04,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:25:04,692 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:04,707 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:04,708 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:25:04,726 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:25:04,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:04,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:04,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:04,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:04,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:04,745 INFO L87 Difference]: Start difference. First operand 90 states and 441 transitions. Second operand 10 states. [2019-03-04 16:25:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:05,189 INFO L93 Difference]: Finished difference Result 131 states and 503 transitions. [2019-03-04 16:25:05,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:05,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:05,191 INFO L225 Difference]: With dead ends: 131 [2019-03-04 16:25:05,191 INFO L226 Difference]: Without dead ends: 130 [2019-03-04 16:25:05,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-03-04 16:25:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 87. [2019-03-04 16:25:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-03-04 16:25:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 427 transitions. [2019-03-04 16:25:05,251 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 427 transitions. Word has length 6 [2019-03-04 16:25:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:05,251 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 427 transitions. [2019-03-04 16:25:05,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 427 transitions. [2019-03-04 16:25:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:05,252 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:05,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:05,252 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:05,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:05,252 INFO L82 PathProgramCache]: Analyzing trace with hash 904550232, now seen corresponding path program 1 times [2019-03-04 16:25:05,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:05,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:05,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:05,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:05,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:05,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:05,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:05,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:05,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:05,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:05,444 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 18 treesize of output 21 [2019-03-04 16:25:05,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,447 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 21 treesize of output 23 [2019-03-04 16:25:05,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,464 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 23 treesize of output 25 [2019-03-04 16:25:05,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,478 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 25 treesize of output 27 [2019-03-04 16:25:05,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,493 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:05,494 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,504 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,513 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,523 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,533 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,552 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:05,553 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:05,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,592 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:05,593 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,612 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:05,612 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:05,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,650 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:05,650 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,670 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:05,670 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:05,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,711 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:05,712 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,731 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:05,732 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:05,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:05,768 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:05,768 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,788 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:05,788 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:25:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:05,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:05,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:05,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:05,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:05,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:05,832 INFO L87 Difference]: Start difference. First operand 87 states and 427 transitions. Second operand 12 states. [2019-03-04 16:25:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:06,712 INFO L93 Difference]: Finished difference Result 157 states and 581 transitions. [2019-03-04 16:25:06,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:06,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:25:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:06,715 INFO L225 Difference]: With dead ends: 157 [2019-03-04 16:25:06,715 INFO L226 Difference]: Without dead ends: 156 [2019-03-04 16:25:06,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:25:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-03-04 16:25:06,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 83. [2019-03-04 16:25:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-03-04 16:25:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 403 transitions. [2019-03-04 16:25:06,757 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 403 transitions. Word has length 6 [2019-03-04 16:25:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:06,757 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 403 transitions. [2019-03-04 16:25:06,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:25:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 403 transitions. [2019-03-04 16:25:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:06,758 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:06,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:06,759 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:06,759 INFO L82 PathProgramCache]: Analyzing trace with hash 904568030, now seen corresponding path program 1 times [2019-03-04 16:25:06,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:06,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:06,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:06,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:06,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:06,824 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:25:06,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:06,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:06,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:06,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:25:06,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:06,846 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 18 treesize of output 21 [2019-03-04 16:25:06,892 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 21 treesize of output 26 [2019-03-04 16:25:06,910 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:25:06,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,932 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:25:06,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:06,958 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:25:06,958 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:06,966 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:06,976 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:06,986 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:06,996 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,009 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:07,010 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-03-04 16:25:07,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,038 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:25:07,038 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,048 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:07,049 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:25:07,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,065 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:25:07,065 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,074 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:07,074 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:25:07,087 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:25:07,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:07,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:07,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:07,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:07,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:07,106 INFO L87 Difference]: Start difference. First operand 83 states and 403 transitions. Second operand 8 states. [2019-03-04 16:25:07,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:07,418 INFO L93 Difference]: Finished difference Result 129 states and 565 transitions. [2019-03-04 16:25:07,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:07,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:25:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:07,421 INFO L225 Difference]: With dead ends: 129 [2019-03-04 16:25:07,421 INFO L226 Difference]: Without dead ends: 128 [2019-03-04 16:25:07,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-03-04 16:25:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 86. [2019-03-04 16:25:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-03-04 16:25:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 421 transitions. [2019-03-04 16:25:07,480 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 421 transitions. Word has length 6 [2019-03-04 16:25:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:07,480 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 421 transitions. [2019-03-04 16:25:07,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 421 transitions. [2019-03-04 16:25:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:07,480 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:07,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:07,481 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:07,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:07,481 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-03-04 16:25:07,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:07,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:07,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:07,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:07,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:07,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:07,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:07,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:07,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:25:07,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:07,656 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 18 treesize of output 21 [2019-03-04 16:25:07,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,664 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 21 treesize of output 23 [2019-03-04 16:25:07,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,670 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 23 treesize of output 25 [2019-03-04 16:25:07,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,681 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 25 treesize of output 27 [2019-03-04 16:25:07,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,697 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:07,697 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,707 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,717 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,728 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,736 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,779 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:07,779 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:07,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,843 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:07,843 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,861 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:07,862 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:07,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,896 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:07,897 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,935 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:07,935 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:07,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,968 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:07,969 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,988 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:07,989 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:08,009 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:25:08,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:08,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:08,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:08,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:08,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:08,028 INFO L87 Difference]: Start difference. First operand 86 states and 421 transitions. Second operand 10 states. [2019-03-04 16:25:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:08,523 INFO L93 Difference]: Finished difference Result 145 states and 557 transitions. [2019-03-04 16:25:08,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:08,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:08,525 INFO L225 Difference]: With dead ends: 145 [2019-03-04 16:25:08,525 INFO L226 Difference]: Without dead ends: 144 [2019-03-04 16:25:08,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-03-04 16:25:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 100. [2019-03-04 16:25:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-03-04 16:25:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 506 transitions. [2019-03-04 16:25:08,585 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 506 transitions. Word has length 6 [2019-03-04 16:25:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:08,585 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 506 transitions. [2019-03-04 16:25:08,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:08,585 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 506 transitions. [2019-03-04 16:25:08,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:08,585 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:08,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:08,586 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:08,586 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-03-04 16:25:08,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:08,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:08,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:08,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:08,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:08,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:08,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:08,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:08,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:25:08,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:08,722 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 18 treesize of output 21 [2019-03-04 16:25:08,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,785 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 21 treesize of output 23 [2019-03-04 16:25:08,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,875 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 23 treesize of output 25 [2019-03-04 16:25:08,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,912 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 25 treesize of output 27 [2019-03-04 16:25:08,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,124 INFO L301 Elim1Store]: Index analysis took 198 ms [2019-03-04 16:25:09,125 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:09,125 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,142 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,154 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,165 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,175 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,193 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:09,193 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:09,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,227 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:09,227 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,246 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:09,246 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:09,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,279 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:09,279 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,298 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:09,299 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:09,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,332 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:09,333 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,352 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:09,353 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:09,373 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:25:09,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:09,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:25:09,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:25:09,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:25:09,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:09,394 INFO L87 Difference]: Start difference. First operand 100 states and 506 transitions. Second operand 9 states. [2019-03-04 16:25:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:09,842 INFO L93 Difference]: Finished difference Result 135 states and 578 transitions. [2019-03-04 16:25:09,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:09,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:25:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:09,845 INFO L225 Difference]: With dead ends: 135 [2019-03-04 16:25:09,845 INFO L226 Difference]: Without dead ends: 134 [2019-03-04 16:25:09,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:09,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-03-04 16:25:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 107. [2019-03-04 16:25:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-03-04 16:25:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 548 transitions. [2019-03-04 16:25:09,928 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 548 transitions. Word has length 6 [2019-03-04 16:25:09,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:09,928 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 548 transitions. [2019-03-04 16:25:09,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:25:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 548 transitions. [2019-03-04 16:25:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:09,929 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:09,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:09,929 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:09,930 INFO L82 PathProgramCache]: Analyzing trace with hash 906278358, now seen corresponding path program 2 times [2019-03-04 16:25:09,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:09,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:09,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:09,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:10,231 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-03-04 16:25:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:10,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:10,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:10,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:10,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:10,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:10,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:10,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:10,325 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 18 treesize of output 21 [2019-03-04 16:25:10,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,333 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 21 treesize of output 23 [2019-03-04 16:25:10,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,345 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 23 treesize of output 25 [2019-03-04 16:25:10,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,353 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 25 treesize of output 27 [2019-03-04 16:25:10,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,368 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:10,369 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,379 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,390 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,400 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,411 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,431 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:10,432 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:10,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,464 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:10,465 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,483 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:10,483 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:10,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,538 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:10,538 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,558 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:10,558 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:10,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,590 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:10,591 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,610 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:10,611 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:10,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:10,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:10,645 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:10,665 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:10,665 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:25:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:10,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:10,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:10,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:10,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:10,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:10,713 INFO L87 Difference]: Start difference. First operand 107 states and 548 transitions. Second operand 12 states. [2019-03-04 16:25:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:11,431 INFO L93 Difference]: Finished difference Result 178 states and 695 transitions. [2019-03-04 16:25:11,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:25:11,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:25:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:11,434 INFO L225 Difference]: With dead ends: 178 [2019-03-04 16:25:11,435 INFO L226 Difference]: Without dead ends: 176 [2019-03-04 16:25:11,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:25:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-03-04 16:25:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 110. [2019-03-04 16:25:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-03-04 16:25:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 566 transitions. [2019-03-04 16:25:11,502 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 566 transitions. Word has length 6 [2019-03-04 16:25:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:11,502 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 566 transitions. [2019-03-04 16:25:11,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:25:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 566 transitions. [2019-03-04 16:25:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:11,503 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:11,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:11,503 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:11,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:11,503 INFO L82 PathProgramCache]: Analyzing trace with hash 906286234, now seen corresponding path program 1 times [2019-03-04 16:25:11,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:11,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:11,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:11,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:11,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:11,617 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:25:11,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:11,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:11,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:11,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:25:11,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:11,640 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 18 treesize of output 21 [2019-03-04 16:25:11,658 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 21 treesize of output 26 [2019-03-04 16:25:11,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,680 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:25:11,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,696 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:25:11,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,717 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:11,718 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,727 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,737 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,747 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,757 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,774 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:11,774 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:25:11,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,811 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:25:11,811 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,826 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:11,826 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:25:11,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,849 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:25:11,849 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,864 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:11,864 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:25:11,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,890 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:11,890 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,905 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:11,905 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:25:11,920 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:25:11,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:11,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:11,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:11,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:11,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:11,940 INFO L87 Difference]: Start difference. First operand 110 states and 566 transitions. Second operand 10 states. [2019-03-04 16:25:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:12,432 INFO L93 Difference]: Finished difference Result 158 states and 650 transitions. [2019-03-04 16:25:12,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:12,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:12,434 INFO L225 Difference]: With dead ends: 158 [2019-03-04 16:25:12,434 INFO L226 Difference]: Without dead ends: 157 [2019-03-04 16:25:12,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-03-04 16:25:12,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 113. [2019-03-04 16:25:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-03-04 16:25:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 584 transitions. [2019-03-04 16:25:12,508 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 584 transitions. Word has length 6 [2019-03-04 16:25:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:12,509 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 584 transitions. [2019-03-04 16:25:12,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 584 transitions. [2019-03-04 16:25:12,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:12,509 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:12,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:12,510 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:12,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash 906397274, now seen corresponding path program 1 times [2019-03-04 16:25:12,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:12,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:12,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:12,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:12,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:12,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:12,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:12,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:12,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:12,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:12,691 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 18 treesize of output 21 [2019-03-04 16:25:12,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,694 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 21 treesize of output 23 [2019-03-04 16:25:12,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,700 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 23 treesize of output 25 [2019-03-04 16:25:12,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,711 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 25 treesize of output 27 [2019-03-04 16:25:12,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,726 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:12,726 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,736 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,747 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,757 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,767 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,786 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:12,786 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:12,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,820 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:12,820 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,840 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:12,840 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:12,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,875 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:12,875 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,894 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:12,895 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:12,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,930 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:12,930 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,950 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:12,950 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:12,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,985 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:12,986 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,004 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:13,004 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:13,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:13,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:13,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:13,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:13,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:13,046 INFO L87 Difference]: Start difference. First operand 113 states and 584 transitions. Second operand 12 states. [2019-03-04 16:25:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:13,794 INFO L93 Difference]: Finished difference Result 196 states and 791 transitions. [2019-03-04 16:25:13,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:13,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:25:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:13,798 INFO L225 Difference]: With dead ends: 196 [2019-03-04 16:25:13,798 INFO L226 Difference]: Without dead ends: 195 [2019-03-04 16:25:13,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:25:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-03-04 16:25:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 123. [2019-03-04 16:25:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-03-04 16:25:13,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 644 transitions. [2019-03-04 16:25:13,876 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 644 transitions. Word has length 6 [2019-03-04 16:25:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:13,876 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 644 transitions. [2019-03-04 16:25:13,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:25:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 644 transitions. [2019-03-04 16:25:13,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:13,878 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:13,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:13,878 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:13,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:13,879 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-03-04 16:25:13,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:13,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:13,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:13,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:13,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:14,381 WARN L181 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-03-04 16:25:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:14,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:14,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:14,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:14,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:25:14,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:14,581 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 18 treesize of output 21 [2019-03-04 16:25:14,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,587 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 21 treesize of output 23 [2019-03-04 16:25:14,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,594 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 23 treesize of output 25 [2019-03-04 16:25:14,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,604 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 25 treesize of output 27 [2019-03-04 16:25:14,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,619 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:14,620 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,630 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,640 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,651 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,661 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,678 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:14,679 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:14,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,709 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:14,710 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,729 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:14,729 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:14,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:14,768 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:14,769 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,790 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:14,791 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:14,813 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:25:14,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:14,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:14,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:14,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:14,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:14,832 INFO L87 Difference]: Start difference. First operand 123 states and 644 transitions. Second operand 8 states. [2019-03-04 16:25:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:15,149 INFO L93 Difference]: Finished difference Result 147 states and 671 transitions. [2019-03-04 16:25:15,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:15,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:25:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:15,152 INFO L225 Difference]: With dead ends: 147 [2019-03-04 16:25:15,152 INFO L226 Difference]: Without dead ends: 146 [2019-03-04 16:25:15,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:15,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-03-04 16:25:15,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 124. [2019-03-04 16:25:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-03-04 16:25:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 650 transitions. [2019-03-04 16:25:15,229 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 650 transitions. Word has length 6 [2019-03-04 16:25:15,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:15,229 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 650 transitions. [2019-03-04 16:25:15,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:15,229 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 650 transitions. [2019-03-04 16:25:15,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:15,230 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:15,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:15,230 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:15,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:15,230 INFO L82 PathProgramCache]: Analyzing trace with hash 893472260, now seen corresponding path program 1 times [2019-03-04 16:25:15,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:15,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:15,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:15,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:15,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:15,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:15,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:15,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:15,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:25:15,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:15,426 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 18 treesize of output 21 [2019-03-04 16:25:15,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,449 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 21 treesize of output 23 [2019-03-04 16:25:15,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,457 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 23 treesize of output 25 [2019-03-04 16:25:15,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,468 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 25 treesize of output 27 [2019-03-04 16:25:15,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,483 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:15,484 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,494 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,502 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,512 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,522 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,541 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:15,541 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:15,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,572 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:15,573 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,592 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:15,592 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:15,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,625 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:15,626 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,645 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:15,645 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:15,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,679 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:15,679 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,699 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:15,699 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:15,719 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:25:15,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:15,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:15,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:15,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:15,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:15,738 INFO L87 Difference]: Start difference. First operand 124 states and 650 transitions. Second operand 10 states. [2019-03-04 16:25:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:16,365 INFO L93 Difference]: Finished difference Result 185 states and 789 transitions. [2019-03-04 16:25:16,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:16,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:16,368 INFO L225 Difference]: With dead ends: 185 [2019-03-04 16:25:16,368 INFO L226 Difference]: Without dead ends: 184 [2019-03-04 16:25:16,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-03-04 16:25:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 136. [2019-03-04 16:25:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-03-04 16:25:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 722 transitions. [2019-03-04 16:25:16,524 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 722 transitions. Word has length 6 [2019-03-04 16:25:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:16,524 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 722 transitions. [2019-03-04 16:25:16,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 722 transitions. [2019-03-04 16:25:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:16,525 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:16,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:16,526 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:16,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:16,526 INFO L82 PathProgramCache]: Analyzing trace with hash 897341246, now seen corresponding path program 2 times [2019-03-04 16:25:16,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:16,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:16,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:16,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:16,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:16,716 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:25:16,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:16,717 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:16,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:16,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:16,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:16,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:25:16,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:16,738 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 18 treesize of output 21 [2019-03-04 16:25:16,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,742 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 21 treesize of output 23 [2019-03-04 16:25:16,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,749 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 23 treesize of output 25 [2019-03-04 16:25:16,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,759 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 25 treesize of output 27 [2019-03-04 16:25:16,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,774 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:16,774 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,784 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,795 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,805 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,815 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,834 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:16,834 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:16,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,869 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:16,870 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,887 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:16,888 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:16,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,920 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:16,921 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,944 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:16,944 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:16,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:16,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:17,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:17,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:17,014 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:17,014 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,032 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:17,033 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:17,054 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:25:17,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:17,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:17,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:17,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:17,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:17,073 INFO L87 Difference]: Start difference. First operand 136 states and 722 transitions. Second operand 10 states. [2019-03-04 16:25:17,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:17,649 INFO L93 Difference]: Finished difference Result 197 states and 861 transitions. [2019-03-04 16:25:17,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:17,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:17,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:17,652 INFO L225 Difference]: With dead ends: 197 [2019-03-04 16:25:17,652 INFO L226 Difference]: Without dead ends: 191 [2019-03-04 16:25:17,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-03-04 16:25:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 144. [2019-03-04 16:25:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-03-04 16:25:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 770 transitions. [2019-03-04 16:25:17,743 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 770 transitions. Word has length 6 [2019-03-04 16:25:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:17,743 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 770 transitions. [2019-03-04 16:25:17,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 770 transitions. [2019-03-04 16:25:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:17,744 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:17,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:17,744 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:17,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:17,744 INFO L82 PathProgramCache]: Analyzing trace with hash 897358608, now seen corresponding path program 1 times [2019-03-04 16:25:17,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:17,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:17,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:17,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:17,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:18,042 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-03-04 16:25:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:18,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:18,110 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:18,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:18,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:25:18,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:18,133 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 18 treesize of output 21 [2019-03-04 16:25:18,148 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 21 treesize of output 26 [2019-03-04 16:25:18,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,159 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:25:18,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,174 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:25:18,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,194 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:18,195 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,203 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,213 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,247 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,257 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,274 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:18,274 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:25:18,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,310 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:25:18,311 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,325 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:18,325 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:25:18,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,349 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:18,349 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,364 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:18,364 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:25:18,381 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:25:18,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:18,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:18,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:18,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:18,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:18,402 INFO L87 Difference]: Start difference. First operand 144 states and 770 transitions. Second operand 8 states. [2019-03-04 16:25:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:18,790 INFO L93 Difference]: Finished difference Result 163 states and 793 transitions. [2019-03-04 16:25:18,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:18,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:25:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:18,793 INFO L225 Difference]: With dead ends: 163 [2019-03-04 16:25:18,793 INFO L226 Difference]: Without dead ends: 162 [2019-03-04 16:25:18,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-03-04 16:25:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 144. [2019-03-04 16:25:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-03-04 16:25:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 770 transitions. [2019-03-04 16:25:18,884 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 770 transitions. Word has length 6 [2019-03-04 16:25:18,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:18,884 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 770 transitions. [2019-03-04 16:25:18,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 770 transitions. [2019-03-04 16:25:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:18,885 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:18,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:18,885 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:18,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:18,885 INFO L82 PathProgramCache]: Analyzing trace with hash 897348934, now seen corresponding path program 2 times [2019-03-04 16:25:18,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:18,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:18,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:18,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:18,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:19,067 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2019-03-04 16:25:19,165 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:25:19,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:19,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:19,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:19,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:19,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:19,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:25:19,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:19,184 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 18 treesize of output 21 [2019-03-04 16:25:19,199 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 21 treesize of output 26 [2019-03-04 16:25:19,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,215 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:25:19,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,242 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:25:19,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,271 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:19,272 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,286 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,299 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,314 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,331 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,356 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:19,357 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:25:19,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,400 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:25:19,400 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,415 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:19,415 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:25:19,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,441 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:19,441 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,456 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:19,457 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:25:19,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,492 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:19,493 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,506 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:19,507 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:25:19,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:25:19,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:19,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:19,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:19,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:19,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:19,546 INFO L87 Difference]: Start difference. First operand 144 states and 770 transitions. Second operand 10 states. [2019-03-04 16:25:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:20,051 INFO L93 Difference]: Finished difference Result 188 states and 847 transitions. [2019-03-04 16:25:20,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:20,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:20,053 INFO L225 Difference]: With dead ends: 188 [2019-03-04 16:25:20,054 INFO L226 Difference]: Without dead ends: 187 [2019-03-04 16:25:20,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-03-04 16:25:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 143. [2019-03-04 16:25:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-03-04 16:25:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 764 transitions. [2019-03-04 16:25:20,157 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 764 transitions. Word has length 6 [2019-03-04 16:25:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:20,157 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 764 transitions. [2019-03-04 16:25:20,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 764 transitions. [2019-03-04 16:25:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:20,158 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:20,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:20,158 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash 896931860, now seen corresponding path program 2 times [2019-03-04 16:25:20,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:20,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:20,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:20,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:20,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:20,448 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-03-04 16:25:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:20,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:20,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:20,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:20,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:20,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:20,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:25:20,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:20,512 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 18 treesize of output 21 [2019-03-04 16:25:20,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,572 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 21 treesize of output 23 [2019-03-04 16:25:20,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,640 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 23 treesize of output 25 [2019-03-04 16:25:20,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,649 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 25 treesize of output 27 [2019-03-04 16:25:20,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,665 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:20,666 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,675 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,686 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,696 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,706 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,725 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:20,725 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:20,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,763 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:20,763 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,783 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:20,783 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:20,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:20,819 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,838 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:20,839 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:20,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:20,873 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:20,873 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,893 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:20,893 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:20,915 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:25:20,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:20,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:25:20,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:25:20,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:25:20,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:20,934 INFO L87 Difference]: Start difference. First operand 143 states and 764 transitions. Second operand 9 states. [2019-03-04 16:25:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:21,546 INFO L93 Difference]: Finished difference Result 193 states and 873 transitions. [2019-03-04 16:25:21,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:21,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:25:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:21,549 INFO L225 Difference]: With dead ends: 193 [2019-03-04 16:25:21,550 INFO L226 Difference]: Without dead ends: 192 [2019-03-04 16:25:21,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-03-04 16:25:21,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 144. [2019-03-04 16:25:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-03-04 16:25:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 771 transitions. [2019-03-04 16:25:21,641 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 771 transitions. Word has length 6 [2019-03-04 16:25:21,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:21,641 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 771 transitions. [2019-03-04 16:25:21,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:25:21,642 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 771 transitions. [2019-03-04 16:25:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:21,642 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:21,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:21,642 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:21,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:21,643 INFO L82 PathProgramCache]: Analyzing trace with hash 897179862, now seen corresponding path program 1 times [2019-03-04 16:25:21,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:21,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:21,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:21,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:21,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:21,975 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-03-04 16:25:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:22,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:22,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:22,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:22,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:25:22,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:22,160 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 18 treesize of output 21 [2019-03-04 16:25:22,177 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 21 treesize of output 26 [2019-03-04 16:25:22,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,193 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:25:22,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,210 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:25:22,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,233 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:22,234 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,242 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,253 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,263 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,274 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,293 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:22,293 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:25:22,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,328 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:25:22,329 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,351 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:22,352 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:25:22,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,374 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:22,374 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,389 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:22,389 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:25:22,408 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:25:22,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:22,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:22,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:22,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:22,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:22,427 INFO L87 Difference]: Start difference. First operand 144 states and 771 transitions. Second operand 8 states. [2019-03-04 16:25:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:22,820 INFO L93 Difference]: Finished difference Result 193 states and 920 transitions. [2019-03-04 16:25:22,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:22,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:25:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:22,822 INFO L225 Difference]: With dead ends: 193 [2019-03-04 16:25:22,823 INFO L226 Difference]: Without dead ends: 192 [2019-03-04 16:25:22,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-03-04 16:25:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 160. [2019-03-04 16:25:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-03-04 16:25:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 868 transitions. [2019-03-04 16:25:22,927 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 868 transitions. Word has length 6 [2019-03-04 16:25:22,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:22,927 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 868 transitions. [2019-03-04 16:25:22,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 868 transitions. [2019-03-04 16:25:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:22,928 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:22,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:22,928 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:22,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:22,928 INFO L82 PathProgramCache]: Analyzing trace with hash 900629352, now seen corresponding path program 2 times [2019-03-04 16:25:22,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:22,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:22,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:22,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:22,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:23,127 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-03-04 16:25:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:23,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:23,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:23,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:23,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:23,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:23,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:23,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:23,239 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 18 treesize of output 21 [2019-03-04 16:25:23,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,243 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 21 treesize of output 23 [2019-03-04 16:25:23,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,252 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 23 treesize of output 25 [2019-03-04 16:25:23,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,261 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 25 treesize of output 27 [2019-03-04 16:25:23,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,276 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:23,277 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,287 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,297 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,306 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,317 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,336 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:23,336 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:23,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,374 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:23,375 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,394 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:23,394 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:23,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,430 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:23,430 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,449 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:23,450 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:23,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,522 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:23,523 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,541 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:23,541 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:23,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,575 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:23,576 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,595 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:23,595 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:25:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:23,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:23,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:23,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:23,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:23,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:23,641 INFO L87 Difference]: Start difference. First operand 160 states and 868 transitions. Second operand 12 states. [2019-03-04 16:25:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:24,778 INFO L93 Difference]: Finished difference Result 230 states and 1002 transitions. [2019-03-04 16:25:24,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:24,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:25:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:24,782 INFO L225 Difference]: With dead ends: 230 [2019-03-04 16:25:24,782 INFO L226 Difference]: Without dead ends: 228 [2019-03-04 16:25:24,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:25:24,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-03-04 16:25:24,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 148. [2019-03-04 16:25:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-03-04 16:25:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 795 transitions. [2019-03-04 16:25:24,912 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 795 transitions. Word has length 6 [2019-03-04 16:25:24,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:24,912 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 795 transitions. [2019-03-04 16:25:24,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:25:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 795 transitions. [2019-03-04 16:25:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:24,913 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:24,913 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:25:24,913 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:24,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:24,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2018165446, now seen corresponding path program 3 times [2019-03-04 16:25:24,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:24,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:24,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:24,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:24,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:25,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:25,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:25,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:25,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:25:25,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:25,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:25:25,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:25,137 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 18 treesize of output 21 [2019-03-04 16:25:25,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,140 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 21 treesize of output 23 [2019-03-04 16:25:25,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,156 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 23 treesize of output 25 [2019-03-04 16:25:25,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,174 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 25 treesize of output 27 [2019-03-04 16:25:25,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,186 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:25,187 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,197 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,207 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,217 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,227 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,246 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:25,247 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:25,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,282 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:25,283 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,302 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:25,302 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:25,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,341 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:25,342 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,361 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:25,361 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:25,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,399 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:25,399 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,419 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:25,419 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:25,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,457 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:25,457 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,477 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:25,477 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:25,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,521 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:25,521 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,538 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:25,539 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:25:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:25,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:25,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-03-04 16:25:25,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:25:25,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:25:25,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:25,589 INFO L87 Difference]: Start difference. First operand 148 states and 795 transitions. Second operand 13 states. [2019-03-04 16:25:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:26,525 INFO L93 Difference]: Finished difference Result 225 states and 965 transitions. [2019-03-04 16:25:26,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:25:26,526 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-03-04 16:25:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:26,529 INFO L225 Difference]: With dead ends: 225 [2019-03-04 16:25:26,529 INFO L226 Difference]: Without dead ends: 223 [2019-03-04 16:25:26,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:25:26,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-03-04 16:25:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 123. [2019-03-04 16:25:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-03-04 16:25:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 642 transitions. [2019-03-04 16:25:26,630 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 642 transitions. Word has length 7 [2019-03-04 16:25:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:26,630 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 642 transitions. [2019-03-04 16:25:26,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:25:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 642 transitions. [2019-03-04 16:25:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:26,630 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:26,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:26,631 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:26,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:26,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2018172698, now seen corresponding path program 1 times [2019-03-04 16:25:26,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:26,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:26,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:26,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:26,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:26,844 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-03-04 16:25:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:26,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:26,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:26,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:26,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:26,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:26,947 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 18 treesize of output 21 [2019-03-04 16:25:26,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,951 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 21 treesize of output 23 [2019-03-04 16:25:26,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,964 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 23 treesize of output 25 [2019-03-04 16:25:26,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,973 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 25 treesize of output 27 [2019-03-04 16:25:26,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:26,988 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:26,989 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,999 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,009 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,020 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,030 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,049 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:27,050 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:27,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,083 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:27,083 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,102 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:27,103 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:27,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,133 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:27,134 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,153 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:27,153 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:27,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,187 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:27,188 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,207 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:27,208 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:27,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,245 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:27,246 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,272 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:27,273 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:25:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:27,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:27,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:27,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:27,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:27,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:27,316 INFO L87 Difference]: Start difference. First operand 123 states and 642 transitions. Second operand 12 states. [2019-03-04 16:25:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:28,081 INFO L93 Difference]: Finished difference Result 176 states and 732 transitions. [2019-03-04 16:25:28,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:25:28,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:25:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:28,084 INFO L225 Difference]: With dead ends: 176 [2019-03-04 16:25:28,084 INFO L226 Difference]: Without dead ends: 175 [2019-03-04 16:25:28,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:25:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-03-04 16:25:28,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 121. [2019-03-04 16:25:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-03-04 16:25:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 630 transitions. [2019-03-04 16:25:28,178 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 630 transitions. Word has length 7 [2019-03-04 16:25:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:28,178 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 630 transitions. [2019-03-04 16:25:28,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:25:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 630 transitions. [2019-03-04 16:25:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:28,178 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:28,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:28,179 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:28,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:28,179 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-03-04 16:25:28,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:28,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:28,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:28,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:28,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:28,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:28,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:28,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:28,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:28,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:28,417 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 18 treesize of output 21 [2019-03-04 16:25:28,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,420 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 21 treesize of output 23 [2019-03-04 16:25:28,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,428 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 23 treesize of output 25 [2019-03-04 16:25:28,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,437 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 25 treesize of output 27 [2019-03-04 16:25:28,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,452 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:28,452 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,464 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,473 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,484 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,495 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,515 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,515 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:28,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,553 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:28,554 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,573 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:28,573 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:28,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,606 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:28,607 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,626 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:28,627 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:28,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,662 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:28,663 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,682 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:28,683 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:28,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:28,735 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:28,735 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,753 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:28,753 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:28,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:28,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:25:28,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:25:28,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:25:28,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:28,794 INFO L87 Difference]: Start difference. First operand 121 states and 630 transitions. Second operand 11 states. [2019-03-04 16:25:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:29,671 INFO L93 Difference]: Finished difference Result 158 states and 686 transitions. [2019-03-04 16:25:29,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:29,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:25:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:29,673 INFO L225 Difference]: With dead ends: 158 [2019-03-04 16:25:29,673 INFO L226 Difference]: Without dead ends: 157 [2019-03-04 16:25:29,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:25:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-03-04 16:25:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 122. [2019-03-04 16:25:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-03-04 16:25:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 636 transitions. [2019-03-04 16:25:29,772 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 636 transitions. Word has length 7 [2019-03-04 16:25:29,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:29,773 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 636 transitions. [2019-03-04 16:25:29,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:25:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 636 transitions. [2019-03-04 16:25:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:29,773 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:29,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:29,773 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:29,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:29,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2017938650, now seen corresponding path program 1 times [2019-03-04 16:25:29,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:29,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:29,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:30,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:30,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:30,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:30,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:25:30,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:30,029 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 18 treesize of output 21 [2019-03-04 16:25:30,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,034 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 21 treesize of output 23 [2019-03-04 16:25:30,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:30,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,060 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 25 treesize of output 27 [2019-03-04 16:25:30,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,075 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:30,075 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,086 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,095 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,105 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,115 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,132 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,132 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:30,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,169 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:30,169 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,188 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:30,189 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:30,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,227 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:30,228 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,251 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:30,251 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:30,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,287 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:30,288 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,307 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:30,307 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:30,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,347 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:30,348 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,367 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:30,367 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:30,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:30,403 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:30,403 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,423 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:30,423 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:25:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:30,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:30,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:25:30,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:25:30,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:25:30,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:25:30,472 INFO L87 Difference]: Start difference. First operand 122 states and 636 transitions. Second operand 14 states. [2019-03-04 16:25:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:31,492 INFO L93 Difference]: Finished difference Result 196 states and 783 transitions. [2019-03-04 16:25:31,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:25:31,493 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-03-04 16:25:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:31,495 INFO L225 Difference]: With dead ends: 196 [2019-03-04 16:25:31,495 INFO L226 Difference]: Without dead ends: 195 [2019-03-04 16:25:31,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:25:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-03-04 16:25:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 119. [2019-03-04 16:25:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-03-04 16:25:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 616 transitions. [2019-03-04 16:25:31,588 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 616 transitions. Word has length 7 [2019-03-04 16:25:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:31,588 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 616 transitions. [2019-03-04 16:25:31,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:25:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 616 transitions. [2019-03-04 16:25:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:31,589 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:31,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:31,589 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:31,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:31,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2017934370, now seen corresponding path program 1 times [2019-03-04 16:25:31,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:31,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:31,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:31,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:31,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:31,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:31,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:31,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:31,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:25:31,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:31,753 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 18 treesize of output 21 [2019-03-04 16:25:31,769 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 21 treesize of output 26 [2019-03-04 16:25:31,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,783 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:25:31,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,799 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:25:31,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,820 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:31,820 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:31,831 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:31,839 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:31,849 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:31,859 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:31,875 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:31,876 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:25:31,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,918 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:25:31,919 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:31,934 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:31,935 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:25:31,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,959 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:31,960 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:31,975 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:31,976 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:25:31,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:31,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:32,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:32,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:32,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:32,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:32,005 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:32,005 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:32,021 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:32,021 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:25:32,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:32,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:32,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:32,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:32,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:32,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:32,048 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:32,048 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:32,062 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:32,062 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:25:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:32,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:32,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:32,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:32,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:32,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:32,102 INFO L87 Difference]: Start difference. First operand 119 states and 616 transitions. Second operand 12 states. [2019-03-04 16:25:32,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:32,790 INFO L93 Difference]: Finished difference Result 170 states and 725 transitions. [2019-03-04 16:25:32,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:32,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:25:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:32,792 INFO L225 Difference]: With dead ends: 170 [2019-03-04 16:25:32,792 INFO L226 Difference]: Without dead ends: 169 [2019-03-04 16:25:32,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:25:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-03-04 16:25:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 123. [2019-03-04 16:25:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-03-04 16:25:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 641 transitions. [2019-03-04 16:25:32,892 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 641 transitions. Word has length 7 [2019-03-04 16:25:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:32,892 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 641 transitions. [2019-03-04 16:25:32,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:25:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 641 transitions. [2019-03-04 16:25:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:32,893 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:32,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:32,894 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:32,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2030969310, now seen corresponding path program 1 times [2019-03-04 16:25:32,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:32,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:32,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:32,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:32,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:33,051 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-03-04 16:25:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:33,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:33,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:33,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:33,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:25:33,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:33,148 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 18 treesize of output 21 [2019-03-04 16:25:33,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,151 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 21 treesize of output 23 [2019-03-04 16:25:33,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,158 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 23 treesize of output 25 [2019-03-04 16:25:33,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,168 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 25 treesize of output 27 [2019-03-04 16:25:33,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,260 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:33,260 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,271 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,279 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,289 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,299 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,318 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:33,318 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:33,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,352 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:33,352 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,371 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:33,372 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:33,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,407 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:33,407 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,427 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:33,427 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:33,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,460 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:33,460 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,480 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:33,480 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:25:33,501 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:25:33,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:33,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:33,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:33,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:33,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:33,519 INFO L87 Difference]: Start difference. First operand 123 states and 641 transitions. Second operand 10 states. [2019-03-04 16:25:33,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:33,999 INFO L93 Difference]: Finished difference Result 148 states and 670 transitions. [2019-03-04 16:25:34,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:34,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:25:34,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:34,002 INFO L225 Difference]: With dead ends: 148 [2019-03-04 16:25:34,002 INFO L226 Difference]: Without dead ends: 147 [2019-03-04 16:25:34,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:34,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-03-04 16:25:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2019-03-04 16:25:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-03-04 16:25:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 647 transitions. [2019-03-04 16:25:34,095 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 647 transitions. Word has length 7 [2019-03-04 16:25:34,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:34,095 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 647 transitions. [2019-03-04 16:25:34,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 647 transitions. [2019-03-04 16:25:34,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:34,096 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:34,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:34,096 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:34,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2030863664, now seen corresponding path program 1 times [2019-03-04 16:25:34,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:34,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:34,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:34,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:34,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:34,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:34,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:34,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:34,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:34,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:34,249 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 18 treesize of output 21 [2019-03-04 16:25:34,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,254 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 21 treesize of output 23 [2019-03-04 16:25:34,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,264 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 23 treesize of output 25 [2019-03-04 16:25:34,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,278 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 25 treesize of output 27 [2019-03-04 16:25:34,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,295 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:34,296 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,325 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,335 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,345 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,355 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,383 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:34,383 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:34,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,442 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:34,443 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,463 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:34,464 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:34,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,520 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:34,521 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,544 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:34,544 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:34,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,596 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:34,596 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,621 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:34,621 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:34,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,670 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:34,671 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,696 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:34,696 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:25:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:34,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:34,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:25:34,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:25:34,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:25:34,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:34,746 INFO L87 Difference]: Start difference. First operand 124 states and 647 transitions. Second operand 11 states. [2019-03-04 16:25:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:35,501 INFO L93 Difference]: Finished difference Result 186 states and 777 transitions. [2019-03-04 16:25:35,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:35,501 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:25:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:35,503 INFO L225 Difference]: With dead ends: 186 [2019-03-04 16:25:35,504 INFO L226 Difference]: Without dead ends: 185 [2019-03-04 16:25:35,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:25:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-03-04 16:25:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 127. [2019-03-04 16:25:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-03-04 16:25:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 665 transitions. [2019-03-04 16:25:35,608 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 665 transitions. Word has length 7 [2019-03-04 16:25:35,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:35,608 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 665 transitions. [2019-03-04 16:25:35,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:25:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 665 transitions. [2019-03-04 16:25:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:35,608 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:35,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:35,609 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:35,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:35,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 2 times [2019-03-04 16:25:35,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:35,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:35,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:35,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:35,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:35,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:35,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:35,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:35,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:35,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:35,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:35,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:35,801 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 18 treesize of output 21 [2019-03-04 16:25:35,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,806 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 21 treesize of output 23 [2019-03-04 16:25:35,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,811 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 23 treesize of output 25 [2019-03-04 16:25:35,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,821 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 25 treesize of output 27 [2019-03-04 16:25:35,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,836 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:35,836 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,846 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,856 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,866 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,877 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,895 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:35,896 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:35,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,933 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:35,933 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,952 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:35,953 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:35,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,985 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:35,986 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,006 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:36,006 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:25:36,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,040 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:25:36,041 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,060 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:36,061 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:25:36,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,097 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:25:36,097 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,117 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:36,117 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:25:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:36,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:36,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:36,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:36,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:36,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:36,157 INFO L87 Difference]: Start difference. First operand 127 states and 665 transitions. Second operand 12 states. [2019-03-04 16:25:36,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:36,865 INFO L93 Difference]: Finished difference Result 173 states and 729 transitions. [2019-03-04 16:25:36,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:36,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:25:36,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:36,868 INFO L225 Difference]: With dead ends: 173 [2019-03-04 16:25:36,868 INFO L226 Difference]: Without dead ends: 172 [2019-03-04 16:25:36,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:25:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-03-04 16:25:36,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 126. [2019-03-04 16:25:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-03-04 16:25:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 659 transitions. [2019-03-04 16:25:36,977 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 659 transitions. Word has length 7 [2019-03-04 16:25:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:36,977 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 659 transitions. [2019-03-04 16:25:36,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:25:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 659 transitions. [2019-03-04 16:25:36,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:36,978 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:36,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:36,978 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:36,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:36,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2026977316, now seen corresponding path program 1 times [2019-03-04 16:25:36,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:36,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:36,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:36,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:36,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:37,122 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-03-04 16:25:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:37,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:37,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:37,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:37,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:25:37,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:37,199 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 18 treesize of output 21 [2019-03-04 16:25:37,208 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 21 treesize of output 26 [2019-03-04 16:25:37,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,220 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:25:37,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,236 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:25:37,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,255 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:37,255 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,263 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,274 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,284 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,294 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,308 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:37,308 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:25:37,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,348 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:25:37,348 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,363 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:37,363 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:25:37,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,389 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:37,389 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,404 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:37,404 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:25:37,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,430 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:25:37,431 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,446 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:37,446 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:25:37,467 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:25:37,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:37,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:37,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:37,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:37,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:37,485 INFO L87 Difference]: Start difference. First operand 126 states and 659 transitions. Second operand 10 states. [2019-03-04 16:25:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:37,998 INFO L93 Difference]: Finished difference Result 147 states and 685 transitions. [2019-03-04 16:25:37,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:37,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:25:37,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:38,001 INFO L225 Difference]: With dead ends: 147 [2019-03-04 16:25:38,001 INFO L226 Difference]: Without dead ends: 146 [2019-03-04 16:25:38,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-03-04 16:25:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2019-03-04 16:25:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-03-04 16:25:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 659 transitions. [2019-03-04 16:25:38,100 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 659 transitions. Word has length 7 [2019-03-04 16:25:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:38,100 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 659 transitions. [2019-03-04 16:25:38,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:38,100 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 659 transitions. [2019-03-04 16:25:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:38,101 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:38,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:38,101 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:38,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:38,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2026986990, now seen corresponding path program 2 times [2019-03-04 16:25:38,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:38,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:38,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:38,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:38,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:38,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:38,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:38,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:38,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:38,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:38,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:25:38,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:38,288 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 18 treesize of output 21 [2019-03-04 16:25:38,301 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 21 treesize of output 26 [2019-03-04 16:25:38,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,313 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:25:38,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,328 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:25:38,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,345 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:38,346 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,356 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,366 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,376 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,387 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,403 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:38,404 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:25:38,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,448 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:25:38,448 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,461 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:38,461 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:25:38,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,491 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:38,491 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,508 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:38,509 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-03-04 16:25:38,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,536 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:25:38,536 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,551 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:38,551 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-03-04 16:25:38,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,578 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:25:38,579 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,592 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:38,592 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:25:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:38,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:38,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:38,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:38,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:38,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:38,632 INFO L87 Difference]: Start difference. First operand 126 states and 659 transitions. Second operand 12 states. [2019-03-04 16:25:39,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:39,376 INFO L93 Difference]: Finished difference Result 170 states and 712 transitions. [2019-03-04 16:25:39,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:39,377 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:25:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:39,379 INFO L225 Difference]: With dead ends: 170 [2019-03-04 16:25:39,379 INFO L226 Difference]: Without dead ends: 169 [2019-03-04 16:25:39,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:25:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-03-04 16:25:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 120. [2019-03-04 16:25:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-03-04 16:25:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 623 transitions. [2019-03-04 16:25:39,476 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 623 transitions. Word has length 7 [2019-03-04 16:25:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:39,476 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 623 transitions. [2019-03-04 16:25:39,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:25:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 623 transitions. [2019-03-04 16:25:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:39,477 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:39,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:39,477 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:39,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:39,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 2 times [2019-03-04 16:25:39,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:39,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:39,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:39,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:39,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:39,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:39,743 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:39,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:39,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:39,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:39,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:39,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:39,763 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 18 treesize of output 21 [2019-03-04 16:25:39,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,769 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 21 treesize of output 23 [2019-03-04 16:25:39,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,780 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 23 treesize of output 25 [2019-03-04 16:25:39,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,800 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 25 treesize of output 27 [2019-03-04 16:25:39,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:39,826 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,842 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,858 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,869 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,879 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,898 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:39,898 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:39,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,937 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:39,938 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,957 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:39,957 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:39,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:39,994 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:39,995 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,014 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:40,014 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:25:40,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,049 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:25:40,050 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,069 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:40,070 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:25:40,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,107 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:25:40,108 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,126 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:40,127 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:25:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:40,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:40,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:40,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:40,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:40,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:40,171 INFO L87 Difference]: Start difference. First operand 120 states and 623 transitions. Second operand 12 states. [2019-03-04 16:25:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:41,085 INFO L93 Difference]: Finished difference Result 200 states and 833 transitions. [2019-03-04 16:25:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:25:41,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:25:41,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:41,087 INFO L225 Difference]: With dead ends: 200 [2019-03-04 16:25:41,087 INFO L226 Difference]: Without dead ends: 199 [2019-03-04 16:25:41,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:25:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-03-04 16:25:41,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 121. [2019-03-04 16:25:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-03-04 16:25:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 630 transitions. [2019-03-04 16:25:41,186 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 630 transitions. Word has length 7 [2019-03-04 16:25:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:41,186 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 630 transitions. [2019-03-04 16:25:41,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:25:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 630 transitions. [2019-03-04 16:25:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:41,187 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:41,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:41,187 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:41,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:41,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2027156062, now seen corresponding path program 1 times [2019-03-04 16:25:41,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:41,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:41,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:41,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:41,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:41,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:41,339 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:41,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:41,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:25:41,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:41,357 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 18 treesize of output 21 [2019-03-04 16:25:41,369 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 21 treesize of output 26 [2019-03-04 16:25:41,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,416 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:25:41,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,433 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:25:41,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,453 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:41,454 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:41,464 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:41,474 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:41,484 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:41,493 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:41,510 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:41,510 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:25:41,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,576 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:25:41,576 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:41,591 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:41,591 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:25:41,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,616 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:25:41,616 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:41,631 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:41,632 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:25:41,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,657 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:25:41,658 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:41,674 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:41,675 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:25:41,696 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:25:41,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:41,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:41,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:41,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:41,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:41,716 INFO L87 Difference]: Start difference. First operand 121 states and 630 transitions. Second operand 10 states. [2019-03-04 16:25:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:42,277 INFO L93 Difference]: Finished difference Result 187 states and 886 transitions. [2019-03-04 16:25:42,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:42,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:25:42,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:42,280 INFO L225 Difference]: With dead ends: 187 [2019-03-04 16:25:42,280 INFO L226 Difference]: Without dead ends: 186 [2019-03-04 16:25:42,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-03-04 16:25:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 108. [2019-03-04 16:25:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:25:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 553 transitions. [2019-03-04 16:25:42,377 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 553 transitions. Word has length 7 [2019-03-04 16:25:42,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:42,377 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 553 transitions. [2019-03-04 16:25:42,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:42,377 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 553 transitions. [2019-03-04 16:25:42,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:42,377 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:42,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:42,378 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:42,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:42,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1962747920, now seen corresponding path program 1 times [2019-03-04 16:25:42,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:42,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:42,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:42,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:42,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:42,527 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:25:42,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:42,527 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:42,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:42,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:25:42,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:42,544 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 18 treesize of output 21 [2019-03-04 16:25:42,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,552 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 21 treesize of output 23 [2019-03-04 16:25:42,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,560 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 23 treesize of output 25 [2019-03-04 16:25:42,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,574 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 25 treesize of output 27 [2019-03-04 16:25:42,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,587 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:42,588 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,598 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,608 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,618 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,629 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,647 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:42,648 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:42,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,678 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:42,678 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,697 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:42,698 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:42,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,732 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:42,733 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,752 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:42,753 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:42,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,787 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:42,787 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,807 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:42,807 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:42,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:42,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:42,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:42,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:42,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:42,847 INFO L87 Difference]: Start difference. First operand 108 states and 553 transitions. Second operand 10 states. [2019-03-04 16:25:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:43,420 INFO L93 Difference]: Finished difference Result 139 states and 591 transitions. [2019-03-04 16:25:43,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:43,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:25:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:43,422 INFO L225 Difference]: With dead ends: 139 [2019-03-04 16:25:43,422 INFO L226 Difference]: Without dead ends: 138 [2019-03-04 16:25:43,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-03-04 16:25:43,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 108. [2019-03-04 16:25:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:25:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 553 transitions. [2019-03-04 16:25:43,516 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 553 transitions. Word has length 7 [2019-03-04 16:25:43,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:43,516 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 553 transitions. [2019-03-04 16:25:43,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:43,516 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 553 transitions. [2019-03-04 16:25:43,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:43,517 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:43,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:43,517 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:43,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:43,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1962209696, now seen corresponding path program 1 times [2019-03-04 16:25:43,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:43,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:43,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:43,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:43,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:43,564 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:25:43,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:43,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:43,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:43,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:25:43,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:43,586 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 18 treesize of output 21 [2019-03-04 16:25:43,602 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 21 treesize of output 26 [2019-03-04 16:25:43,624 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:25:43,651 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:25:43,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:43,679 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 27 treesize of output 35 [2019-03-04 16:25:43,680 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:43,690 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:43,700 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:43,709 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:43,719 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:43,731 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:43,732 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-03-04 16:25:43,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:43,811 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:25:43,812 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:43,841 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:43,841 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-03-04 16:25:43,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:43,854 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:25:43,854 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:43,859 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:43,859 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-03-04 16:25:43,869 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:25:43,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:43,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:43,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:43,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:43,888 INFO L87 Difference]: Start difference. First operand 108 states and 553 transitions. Second operand 8 states. [2019-03-04 16:25:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:44,203 INFO L93 Difference]: Finished difference Result 142 states and 631 transitions. [2019-03-04 16:25:44,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:44,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:25:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:44,205 INFO L225 Difference]: With dead ends: 142 [2019-03-04 16:25:44,205 INFO L226 Difference]: Without dead ends: 141 [2019-03-04 16:25:44,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:44,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-03-04 16:25:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2019-03-04 16:25:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-03-04 16:25:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 589 transitions. [2019-03-04 16:25:44,308 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 589 transitions. Word has length 7 [2019-03-04 16:25:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:44,308 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 589 transitions. [2019-03-04 16:25:44,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 589 transitions. [2019-03-04 16:25:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:44,309 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:44,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:44,309 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:44,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:44,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1962509592, now seen corresponding path program 1 times [2019-03-04 16:25:44,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:44,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:44,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:44,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:44,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:44,414 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:25:44,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:44,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:44,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:44,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:25:44,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:44,436 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 18 treesize of output 21 [2019-03-04 16:25:44,451 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 21 treesize of output 26 [2019-03-04 16:25:44,465 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:25:44,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:44,485 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:25:44,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:44,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:44,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:44,509 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:25:44,509 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:44,519 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:44,529 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:44,539 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:44,549 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:44,563 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:44,563 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-03-04 16:25:44,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:44,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:44,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:44,592 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:25:44,593 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:44,603 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:44,603 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:25:44,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:44,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:44,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:44,720 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:25:44,720 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:44,816 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:44,817 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:25:44,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:44,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:44,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:44,833 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:25:44,833 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:44,844 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:44,844 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:25:44,856 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:25:44,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:44,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:44,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:44,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:44,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:44,875 INFO L87 Difference]: Start difference. First operand 114 states and 589 transitions. Second operand 10 states. [2019-03-04 16:25:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:45,321 INFO L93 Difference]: Finished difference Result 159 states and 682 transitions. [2019-03-04 16:25:45,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:45,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:25:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:45,323 INFO L225 Difference]: With dead ends: 159 [2019-03-04 16:25:45,323 INFO L226 Difference]: Without dead ends: 158 [2019-03-04 16:25:45,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-03-04 16:25:45,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2019-03-04 16:25:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-03-04 16:25:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 631 transitions. [2019-03-04 16:25:45,443 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 631 transitions. Word has length 7 [2019-03-04 16:25:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:45,444 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 631 transitions. [2019-03-04 16:25:45,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 631 transitions. [2019-03-04 16:25:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:45,444 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:45,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:45,445 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:45,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1973605362, now seen corresponding path program 1 times [2019-03-04 16:25:45,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:45,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:45,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:45,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:45,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:45,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:45,593 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:45,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:45,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:45,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:45,613 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 18 treesize of output 21 [2019-03-04 16:25:45,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,656 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 21 treesize of output 23 [2019-03-04 16:25:45,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,661 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 23 treesize of output 25 [2019-03-04 16:25:45,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,671 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 25 treesize of output 27 [2019-03-04 16:25:45,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,686 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:45,686 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,695 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,705 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,715 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,725 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,744 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:45,745 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:45,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,774 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:45,775 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,794 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:45,794 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:45,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,828 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:45,828 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,847 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:45,848 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:46,018 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-03-04 16:25:46,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,142 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:46,143 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:46,161 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:46,162 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:46,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:46,196 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:46,197 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:46,216 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:46,216 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:46,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:46,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:46,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:46,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:46,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:46,259 INFO L87 Difference]: Start difference. First operand 121 states and 631 transitions. Second operand 12 states. [2019-03-04 16:25:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:47,143 INFO L93 Difference]: Finished difference Result 207 states and 899 transitions. [2019-03-04 16:25:47,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:25:47,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:25:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:47,146 INFO L225 Difference]: With dead ends: 207 [2019-03-04 16:25:47,147 INFO L226 Difference]: Without dead ends: 206 [2019-03-04 16:25:47,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:25:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-03-04 16:25:47,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 135. [2019-03-04 16:25:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-03-04 16:25:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 715 transitions. [2019-03-04 16:25:47,277 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 715 transitions. Word has length 7 [2019-03-04 16:25:47,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:47,277 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 715 transitions. [2019-03-04 16:25:47,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:25:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 715 transitions. [2019-03-04 16:25:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:47,278 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:47,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:47,278 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:47,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:47,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-03-04 16:25:47,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:47,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:47,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:47,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:47,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:47,403 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:25:47,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:47,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:47,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:47,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:25:47,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:47,467 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 18 treesize of output 21 [2019-03-04 16:25:47,614 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 21 treesize of output 26 [2019-03-04 16:25:47,871 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:25:47,943 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:25:47,980 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:47,980 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,988 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:47,998 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,007 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,017 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,026 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:48,027 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-03-04 16:25:48,032 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-03-04 16:25:48,032 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,033 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,033 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-03-04 16:25:48,037 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:25:48,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:48,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2019-03-04 16:25:48,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:25:48,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:25:48,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:25:48,056 INFO L87 Difference]: Start difference. First operand 135 states and 715 transitions. Second operand 5 states. [2019-03-04 16:25:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:48,291 INFO L93 Difference]: Finished difference Result 152 states and 751 transitions. [2019-03-04 16:25:48,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:25:48,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-03-04 16:25:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:48,293 INFO L225 Difference]: With dead ends: 152 [2019-03-04 16:25:48,293 INFO L226 Difference]: Without dead ends: 143 [2019-03-04 16:25:48,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:25:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-03-04 16:25:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-03-04 16:25:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-03-04 16:25:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 739 transitions. [2019-03-04 16:25:48,426 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 739 transitions. Word has length 7 [2019-03-04 16:25:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:48,426 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 739 transitions. [2019-03-04 16:25:48,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:25:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 739 transitions. [2019-03-04 16:25:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:48,426 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:48,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:48,427 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:48,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:48,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1970145762, now seen corresponding path program 2 times [2019-03-04 16:25:48,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:48,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:48,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:48,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:48,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:48,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:48,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:48,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:48,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:48,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:48,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:48,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:48,661 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 18 treesize of output 21 [2019-03-04 16:25:48,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,666 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 21 treesize of output 23 [2019-03-04 16:25:48,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,678 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 23 treesize of output 25 [2019-03-04 16:25:48,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,687 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 25 treesize of output 27 [2019-03-04 16:25:48,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,702 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:48,702 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,712 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,723 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,733 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,743 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,761 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:48,761 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:48,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,797 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:48,798 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,817 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:48,817 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:48,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,851 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:48,851 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,871 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:48,871 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:48,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,908 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:48,908 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,928 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:48,928 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:48,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,963 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:48,963 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,983 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:48,983 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:49,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:49,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:25:49,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:25:49,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:25:49,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:49,029 INFO L87 Difference]: Start difference. First operand 142 states and 739 transitions. Second operand 11 states. [2019-03-04 16:25:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:49,933 INFO L93 Difference]: Finished difference Result 219 states and 993 transitions. [2019-03-04 16:25:49,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:49,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:25:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:49,935 INFO L225 Difference]: With dead ends: 219 [2019-03-04 16:25:49,935 INFO L226 Difference]: Without dead ends: 218 [2019-03-04 16:25:49,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:25:49,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-03-04 16:25:50,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 158. [2019-03-04 16:25:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-03-04 16:25:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 836 transitions. [2019-03-04 16:25:50,090 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 836 transitions. Word has length 7 [2019-03-04 16:25:50,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:50,091 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 836 transitions. [2019-03-04 16:25:50,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:25:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 836 transitions. [2019-03-04 16:25:50,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:50,091 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:50,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:50,091 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:50,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:50,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1966084512, now seen corresponding path program 2 times [2019-03-04 16:25:50,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:50,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:50,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:50,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:50,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:50,243 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:25:50,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:50,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:50,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:50,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:50,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:50,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:25:50,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:50,265 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 18 treesize of output 21 [2019-03-04 16:25:50,278 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 21 treesize of output 26 [2019-03-04 16:25:50,296 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:25:50,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,316 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:25:50,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,341 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:25:50,341 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,351 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,361 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,370 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,380 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,394 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:50,394 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-03-04 16:25:50,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,427 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:25:50,427 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,559 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:50,559 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:25:50,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,580 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:25:50,581 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,590 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:50,591 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:25:50,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:50,610 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:25:50,611 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:50,619 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:50,620 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:25:50,634 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:25:50,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:50,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:50,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:50,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:50,654 INFO L87 Difference]: Start difference. First operand 158 states and 836 transitions. Second operand 10 states. [2019-03-04 16:25:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:51,242 INFO L93 Difference]: Finished difference Result 204 states and 930 transitions. [2019-03-04 16:25:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:51,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:25:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:51,245 INFO L225 Difference]: With dead ends: 204 [2019-03-04 16:25:51,245 INFO L226 Difference]: Without dead ends: 199 [2019-03-04 16:25:51,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-03-04 16:25:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 160. [2019-03-04 16:25:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-03-04 16:25:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 847 transitions. [2019-03-04 16:25:51,416 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 847 transitions. Word has length 7 [2019-03-04 16:25:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:51,416 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 847 transitions. [2019-03-04 16:25:51,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 847 transitions. [2019-03-04 16:25:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:51,417 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:51,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:51,417 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:51,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:51,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1966448270, now seen corresponding path program 2 times [2019-03-04 16:25:51,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:51,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:51,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:51,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:51,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:51,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:51,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:51,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:51,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:51,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:51,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:25:51,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:51,675 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 18 treesize of output 21 [2019-03-04 16:25:51,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,683 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 21 treesize of output 23 [2019-03-04 16:25:51,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,691 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 23 treesize of output 25 [2019-03-04 16:25:51,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:51,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,715 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:51,715 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,725 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,736 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,745 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,755 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,773 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,774 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:51,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,818 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:51,818 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,836 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:51,836 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:51,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,876 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:51,877 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,895 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:51,895 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:51,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,933 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:51,934 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:51,952 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:51,952 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:51,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:51,989 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:51,989 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:52,008 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:52,008 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:52,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,045 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:52,046 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:52,065 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:52,066 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:25:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:52,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:52,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:25:52,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:25:52,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:25:52,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:25:52,118 INFO L87 Difference]: Start difference. First operand 160 states and 847 transitions. Second operand 14 states. [2019-03-04 16:25:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:53,358 INFO L93 Difference]: Finished difference Result 197 states and 897 transitions. [2019-03-04 16:25:53,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:25:53,359 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-03-04 16:25:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:53,361 INFO L225 Difference]: With dead ends: 197 [2019-03-04 16:25:53,361 INFO L226 Difference]: Without dead ends: 192 [2019-03-04 16:25:53,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:25:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-03-04 16:25:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 128. [2019-03-04 16:25:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-03-04 16:25:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 656 transitions. [2019-03-04 16:25:53,511 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 656 transitions. Word has length 7 [2019-03-04 16:25:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:53,511 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 656 transitions. [2019-03-04 16:25:53,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:25:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 656 transitions. [2019-03-04 16:25:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:53,512 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:53,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:53,512 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:53,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:53,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1931949486, now seen corresponding path program 1 times [2019-03-04 16:25:53,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:53,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:53,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:53,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:53,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:53,568 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:25:53,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:53,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:53,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:53,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:25:53,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:53,584 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 18 treesize of output 21 [2019-03-04 16:25:53,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,589 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 21 treesize of output 23 [2019-03-04 16:25:53,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,598 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 23 treesize of output 25 [2019-03-04 16:25:53,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,618 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 25 treesize of output 27 [2019-03-04 16:25:53,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,636 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:53,637 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,646 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,656 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,667 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,677 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,696 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:53,696 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:53,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,727 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:53,728 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,747 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:53,747 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:53,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,776 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:53,776 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,794 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:53,794 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:53,814 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:25:53,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:53,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:53,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:53,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:53,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:53,833 INFO L87 Difference]: Start difference. First operand 128 states and 656 transitions. Second operand 8 states. [2019-03-04 16:25:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:54,300 INFO L93 Difference]: Finished difference Result 161 states and 728 transitions. [2019-03-04 16:25:54,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:54,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:25:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:54,303 INFO L225 Difference]: With dead ends: 161 [2019-03-04 16:25:54,303 INFO L226 Difference]: Without dead ends: 160 [2019-03-04 16:25:54,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-03-04 16:25:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 131. [2019-03-04 16:25:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-03-04 16:25:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 674 transitions. [2019-03-04 16:25:54,474 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 674 transitions. Word has length 7 [2019-03-04 16:25:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:54,474 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 674 transitions. [2019-03-04 16:25:54,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 674 transitions. [2019-03-04 16:25:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:54,475 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:54,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:54,475 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:54,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:54,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1931649590, now seen corresponding path program 1 times [2019-03-04 16:25:54,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:54,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:54,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:54,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:54,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:54,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:54,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:54,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:54,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:25:54,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:54,587 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 18 treesize of output 21 [2019-03-04 16:25:54,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,592 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 21 treesize of output 23 [2019-03-04 16:25:54,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,600 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 23 treesize of output 25 [2019-03-04 16:25:54,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,615 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 25 treesize of output 27 [2019-03-04 16:25:54,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,631 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:54,632 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,642 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,652 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,662 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,672 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,691 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:54,692 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:54,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,725 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:54,725 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,742 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:54,742 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:54,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,776 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:54,776 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,794 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:54,794 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:54,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:54,826 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:54,826 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,845 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:54,846 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:54,879 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:25:54,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:54,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:25:54,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:25:54,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:25:54,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:54,899 INFO L87 Difference]: Start difference. First operand 131 states and 674 transitions. Second operand 9 states. [2019-03-04 16:25:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:55,585 INFO L93 Difference]: Finished difference Result 176 states and 767 transitions. [2019-03-04 16:25:55,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:55,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:25:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:55,588 INFO L225 Difference]: With dead ends: 176 [2019-03-04 16:25:55,588 INFO L226 Difference]: Without dead ends: 175 [2019-03-04 16:25:55,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-03-04 16:25:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 137. [2019-03-04 16:25:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-03-04 16:25:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 710 transitions. [2019-03-04 16:25:55,759 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 710 transitions. Word has length 7 [2019-03-04 16:25:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:55,759 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 710 transitions. [2019-03-04 16:25:55,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:25:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 710 transitions. [2019-03-04 16:25:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:55,760 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:55,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:55,760 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:55,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1933796528, now seen corresponding path program 1 times [2019-03-04 16:25:55,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:55,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:55,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:55,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:55,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:56,043 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-03-04 16:25:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:56,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:56,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:56,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:56,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:25:56,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:56,075 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 18 treesize of output 21 [2019-03-04 16:25:56,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,078 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 21 treesize of output 23 [2019-03-04 16:25:56,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,085 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 23 treesize of output 25 [2019-03-04 16:25:56,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,096 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 25 treesize of output 27 [2019-03-04 16:25:56,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,115 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:56,116 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:56,126 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:56,136 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:56,146 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:56,156 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:56,175 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:56,176 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:56,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,207 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:56,207 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:56,226 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:56,227 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:56,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:56,257 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:56,258 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:56,277 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:56,277 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:56,296 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:25:56,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:56,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:25:56,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:25:56,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:25:56,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:25:56,314 INFO L87 Difference]: Start difference. First operand 137 states and 710 transitions. Second operand 7 states. [2019-03-04 16:25:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:56,699 INFO L93 Difference]: Finished difference Result 160 states and 736 transitions. [2019-03-04 16:25:56,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:56,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:25:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:56,701 INFO L225 Difference]: With dead ends: 160 [2019-03-04 16:25:56,701 INFO L226 Difference]: Without dead ends: 151 [2019-03-04 16:25:56,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-03-04 16:25:56,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2019-03-04 16:25:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-03-04 16:25:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 708 transitions. [2019-03-04 16:25:56,874 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 708 transitions. Word has length 7 [2019-03-04 16:25:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:56,874 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 708 transitions. [2019-03-04 16:25:56,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:25:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 708 transitions. [2019-03-04 16:25:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:56,875 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:56,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:56,875 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:56,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 3 times [2019-03-04 16:25:56,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:56,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:56,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:57,316 WARN L181 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-03-04 16:25:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:57,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:57,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:57,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:57,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:25:57,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:57,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:57,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:57,449 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 18 treesize of output 21 [2019-03-04 16:25:57,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,453 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 21 treesize of output 23 [2019-03-04 16:25:57,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,459 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 23 treesize of output 25 [2019-03-04 16:25:57,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,469 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 25 treesize of output 27 [2019-03-04 16:25:57,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,483 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:57,484 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:57,494 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:57,504 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:57,515 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:57,525 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:57,543 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:57,543 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:57,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,579 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:57,580 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:57,597 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:57,598 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:57,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,664 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:57,664 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:57,682 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:57,683 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:57,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,722 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:57,722 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:57,741 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:57,742 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:57,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:57,784 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:25:57,785 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:57,804 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:57,805 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:25:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:57,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:57,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:57,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:57,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:57,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:57,856 INFO L87 Difference]: Start difference. First operand 137 states and 708 transitions. Second operand 12 states. [2019-03-04 16:25:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:58,878 INFO L93 Difference]: Finished difference Result 204 states and 901 transitions. [2019-03-04 16:25:58,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:58,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:25:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:58,881 INFO L225 Difference]: With dead ends: 204 [2019-03-04 16:25:58,881 INFO L226 Difference]: Without dead ends: 198 [2019-03-04 16:25:58,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:25:58,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-03-04 16:25:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 140. [2019-03-04 16:25:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-03-04 16:25:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 725 transitions. [2019-03-04 16:25:59,075 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 725 transitions. Word has length 7 [2019-03-04 16:25:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:59,075 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 725 transitions. [2019-03-04 16:25:59,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:25:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 725 transitions. [2019-03-04 16:25:59,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:59,075 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:59,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:59,076 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:59,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1928074670, now seen corresponding path program 2 times [2019-03-04 16:25:59,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:59,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:59,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:59,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:59,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:59,176 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:25:59,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:59,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:59,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:59,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:59,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:59,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:25:59,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:59,196 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 18 treesize of output 21 [2019-03-04 16:25:59,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,204 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 21 treesize of output 23 [2019-03-04 16:25:59,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,214 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 23 treesize of output 25 [2019-03-04 16:25:59,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,228 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 25 treesize of output 27 [2019-03-04 16:25:59,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,242 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:59,242 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:59,252 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:59,263 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:59,273 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:59,283 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:59,302 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:59,303 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:25:59,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,565 INFO L301 Elim1Store]: Index analysis took 203 ms [2019-03-04 16:25:59,566 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:59,566 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:59,788 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:59,788 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:59,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,856 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,866 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:59,866 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:59,886 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:59,887 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:25:59,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:59,925 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:59,926 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:59,945 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:59,946 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:25:59,969 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:25:59,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:59,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:59,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:59,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:59,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:59,989 INFO L87 Difference]: Start difference. First operand 140 states and 725 transitions. Second operand 10 states. [2019-03-04 16:26:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:00,688 INFO L93 Difference]: Finished difference Result 188 states and 836 transitions. [2019-03-04 16:26:00,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:00,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:26:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:00,690 INFO L225 Difference]: With dead ends: 188 [2019-03-04 16:26:00,690 INFO L226 Difference]: Without dead ends: 186 [2019-03-04 16:26:00,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-03-04 16:26:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 135. [2019-03-04 16:26:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-03-04 16:26:00,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 695 transitions. [2019-03-04 16:26:00,869 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 695 transitions. Word has length 7 [2019-03-04 16:26:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:00,869 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 695 transitions. [2019-03-04 16:26:00,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 695 transitions. [2019-03-04 16:26:00,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:00,870 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:00,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:00,870 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:00,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:00,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2048313132, now seen corresponding path program 1 times [2019-03-04 16:26:00,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:00,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:00,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:00,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:00,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:00,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:00,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:00,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:00,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:26:00,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:00,991 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 18 treesize of output 21 [2019-03-04 16:26:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:26:01,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,015 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:26:01,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,029 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:26:01,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:01,078 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:01,088 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:01,098 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:01,108 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:01,118 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:01,135 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:01,135 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:26:01,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,168 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:01,168 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:01,183 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:01,184 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:26:01,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:01,212 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:26:01,213 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:01,229 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:01,230 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:26:01,256 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:26:01,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:01,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:26:01,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:26:01,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:26:01,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:26:01,275 INFO L87 Difference]: Start difference. First operand 135 states and 695 transitions. Second operand 7 states. [2019-03-04 16:26:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:01,718 INFO L93 Difference]: Finished difference Result 152 states and 726 transitions. [2019-03-04 16:26:01,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:01,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:26:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:01,721 INFO L225 Difference]: With dead ends: 152 [2019-03-04 16:26:01,721 INFO L226 Difference]: Without dead ends: 151 [2019-03-04 16:26:01,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:01,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-03-04 16:26:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2019-03-04 16:26:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-03-04 16:26:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 707 transitions. [2019-03-04 16:26:01,901 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 707 transitions. Word has length 7 [2019-03-04 16:26:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:01,901 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 707 transitions. [2019-03-04 16:26:01,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:26:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 707 transitions. [2019-03-04 16:26:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:01,902 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:01,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:01,902 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:01,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-03-04 16:26:01,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:01,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:01,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:02,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:02,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:02,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:02,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:26:02,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:02,035 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 18 treesize of output 21 [2019-03-04 16:26:02,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,039 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 21 treesize of output 23 [2019-03-04 16:26:02,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,045 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 23 treesize of output 25 [2019-03-04 16:26:02,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,055 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 25 treesize of output 27 [2019-03-04 16:26:02,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,070 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:02,070 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,080 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,091 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,101 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,111 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,130 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:02,130 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:02,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,165 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:02,165 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,185 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:02,185 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:02,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:02,218 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:02,218 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:02,237 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:02,238 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:02,263 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:26:02,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:02,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:26:02,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:26:02,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:26:02,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:26:02,282 INFO L87 Difference]: Start difference. First operand 137 states and 707 transitions. Second operand 7 states. [2019-03-04 16:26:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:02,711 INFO L93 Difference]: Finished difference Result 153 states and 732 transitions. [2019-03-04 16:26:02,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:02,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:26:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:02,714 INFO L225 Difference]: With dead ends: 153 [2019-03-04 16:26:02,714 INFO L226 Difference]: Without dead ends: 152 [2019-03-04 16:26:02,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-03-04 16:26:02,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138. [2019-03-04 16:26:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-03-04 16:26:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 713 transitions. [2019-03-04 16:26:02,897 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 713 transitions. Word has length 7 [2019-03-04 16:26:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:02,897 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 713 transitions. [2019-03-04 16:26:02,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:26:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 713 transitions. [2019-03-04 16:26:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:02,898 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:02,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:02,898 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:02,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:02,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2042772006, now seen corresponding path program 1 times [2019-03-04 16:26:02,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:02,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:02,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:02,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:02,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:03,065 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-03-04 16:26:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:03,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:03,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:03,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:03,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:26:03,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:03,106 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 18 treesize of output 21 [2019-03-04 16:26:03,120 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 21 treesize of output 26 [2019-03-04 16:26:03,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,131 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:26:03,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,147 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:26:03,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,166 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:03,166 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,174 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,185 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,195 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,205 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,221 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:03,222 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:26:03,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,263 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:03,264 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,279 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:03,280 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:26:03,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:03,308 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:26:03,308 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:03,323 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:03,323 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:26:03,345 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:26:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:03,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:26:03,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:26:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:26:03,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:26:03,364 INFO L87 Difference]: Start difference. First operand 138 states and 713 transitions. Second operand 7 states. [2019-03-04 16:26:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:03,818 INFO L93 Difference]: Finished difference Result 153 states and 732 transitions. [2019-03-04 16:26:03,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:03,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:26:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:03,821 INFO L225 Difference]: With dead ends: 153 [2019-03-04 16:26:03,821 INFO L226 Difference]: Without dead ends: 152 [2019-03-04 16:26:03,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-03-04 16:26:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2019-03-04 16:26:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-03-04 16:26:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 719 transitions. [2019-03-04 16:26:04,009 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 719 transitions. Word has length 7 [2019-03-04 16:26:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:04,009 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 719 transitions. [2019-03-04 16:26:04,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:26:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 719 transitions. [2019-03-04 16:26:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:04,009 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:04,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:04,009 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:04,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:04,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2133984602, now seen corresponding path program 1 times [2019-03-04 16:26:04,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:04,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:04,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:04,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:04,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:04,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:04,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:04,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:04,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:26:04,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:04,098 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 18 treesize of output 21 [2019-03-04 16:26:04,110 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 21 treesize of output 26 [2019-03-04 16:26:04,136 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:26:04,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:04,169 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:26:04,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:04,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:04,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:04,193 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:26:04,193 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:04,204 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:04,214 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:04,224 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:04,234 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:04,249 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:04,249 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-03-04 16:26:04,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:04,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:04,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:04,277 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:26:04,278 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:04,288 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:04,288 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:26:04,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:04,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:04,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:04,308 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:26:04,308 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:04,318 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:04,319 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:26:04,334 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:26:04,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:04,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:04,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:04,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:04,353 INFO L87 Difference]: Start difference. First operand 139 states and 719 transitions. Second operand 8 states. [2019-03-04 16:26:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:04,833 INFO L93 Difference]: Finished difference Result 175 states and 788 transitions. [2019-03-04 16:26:04,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:04,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:26:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:04,836 INFO L225 Difference]: With dead ends: 175 [2019-03-04 16:26:04,837 INFO L226 Difference]: Without dead ends: 174 [2019-03-04 16:26:04,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-03-04 16:26:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 141. [2019-03-04 16:26:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-03-04 16:26:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 731 transitions. [2019-03-04 16:26:05,049 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 731 transitions. Word has length 7 [2019-03-04 16:26:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:05,049 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 731 transitions. [2019-03-04 16:26:05,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 731 transitions. [2019-03-04 16:26:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:05,050 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:05,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:05,050 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:05,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:05,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2134403662, now seen corresponding path program 2 times [2019-03-04 16:26:05,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:05,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:05,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:05,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:05,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:05,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:05,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:05,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:05,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:05,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:05,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:26:05,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:05,240 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 18 treesize of output 21 [2019-03-04 16:26:05,252 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 21 treesize of output 26 [2019-03-04 16:26:05,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,271 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:26:05,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,297 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:26:05,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,335 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:05,335 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,349 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,362 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,375 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,390 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,408 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:05,408 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:26:05,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,452 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:05,452 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,467 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:05,468 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:26:05,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,514 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:05,515 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,530 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:05,531 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:26:05,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:05,564 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:26:05,564 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:05,593 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:05,593 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:26:05,613 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:26:05,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:05,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:05,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:05,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:05,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:05,635 INFO L87 Difference]: Start difference. First operand 141 states and 731 transitions. Second operand 10 states. [2019-03-04 16:26:06,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:06,301 INFO L93 Difference]: Finished difference Result 201 states and 904 transitions. [2019-03-04 16:26:06,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:06,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:26:06,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:06,304 INFO L225 Difference]: With dead ends: 201 [2019-03-04 16:26:06,305 INFO L226 Difference]: Without dead ends: 200 [2019-03-04 16:26:06,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-03-04 16:26:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 149. [2019-03-04 16:26:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-03-04 16:26:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 779 transitions. [2019-03-04 16:26:06,550 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 779 transitions. Word has length 7 [2019-03-04 16:26:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:06,551 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 779 transitions. [2019-03-04 16:26:06,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 779 transitions. [2019-03-04 16:26:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:06,551 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:06,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:06,552 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:06,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2132137560, now seen corresponding path program 1 times [2019-03-04 16:26:06,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:06,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:06,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:06,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:06,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:06,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:06,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:06,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:06,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:26:06,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:06,644 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 18 treesize of output 21 [2019-03-04 16:26:06,654 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 21 treesize of output 26 [2019-03-04 16:26:06,672 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:26:06,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:06,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:26:06,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:06,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:06,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:06,716 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:26:06,716 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:06,726 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:06,736 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:06,745 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:06,755 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:06,769 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:06,770 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-03-04 16:26:06,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:06,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:06,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:06,800 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:26:06,800 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:06,811 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:06,811 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:26:06,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:06,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:06,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:06,828 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:26:06,829 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:06,839 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:06,839 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:26:06,856 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:26:06,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:06,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:26:06,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:26:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:26:06,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:26:06,875 INFO L87 Difference]: Start difference. First operand 149 states and 779 transitions. Second operand 7 states. [2019-03-04 16:26:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:07,320 INFO L93 Difference]: Finished difference Result 172 states and 805 transitions. [2019-03-04 16:26:07,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:07,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:26:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:07,322 INFO L225 Difference]: With dead ends: 172 [2019-03-04 16:26:07,322 INFO L226 Difference]: Without dead ends: 163 [2019-03-04 16:26:07,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-03-04 16:26:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2019-03-04 16:26:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-03-04 16:26:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 777 transitions. [2019-03-04 16:26:07,556 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 777 transitions. Word has length 7 [2019-03-04 16:26:07,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:07,557 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 777 transitions. [2019-03-04 16:26:07,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:26:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 777 transitions. [2019-03-04 16:26:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:07,557 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:07,557 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:07,558 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:07,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:07,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1817245912, now seen corresponding path program 2 times [2019-03-04 16:26:07,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:07,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:07,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:07,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:07,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:07,652 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:26:07,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:07,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:07,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:07,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:07,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:07,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:26:07,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:07,671 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 18 treesize of output 21 [2019-03-04 16:26:07,685 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 21 treesize of output 26 [2019-03-04 16:26:07,708 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:26:07,735 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:26:07,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:07,766 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 27 treesize of output 35 [2019-03-04 16:26:07,766 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,774 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,784 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,794 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,804 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,816 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:07,816 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-03-04 16:26:07,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:07,839 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:26:07,839 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,845 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,845 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:16 [2019-03-04 16:26:07,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:07,859 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-03-04 16:26:07,860 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,865 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,865 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:16 [2019-03-04 16:26:07,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:07,880 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-03-04 16:26:07,880 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:07,886 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:07,887 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-03-04 16:26:07,899 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:26:07,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:07,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:07,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:07,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:07,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:07,920 INFO L87 Difference]: Start difference. First operand 149 states and 777 transitions. Second operand 10 states. [2019-03-04 16:26:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:08,566 INFO L93 Difference]: Finished difference Result 250 states and 1188 transitions. [2019-03-04 16:26:08,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:08,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:26:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:08,569 INFO L225 Difference]: With dead ends: 250 [2019-03-04 16:26:08,569 INFO L226 Difference]: Without dead ends: 244 [2019-03-04 16:26:08,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:26:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-03-04 16:26:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 207. [2019-03-04 16:26:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-03-04 16:26:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 1116 transitions. [2019-03-04 16:26:08,920 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 1116 transitions. Word has length 8 [2019-03-04 16:26:08,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:08,920 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 1116 transitions. [2019-03-04 16:26:08,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 1116 transitions. [2019-03-04 16:26:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:08,920 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:08,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:08,921 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:08,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:08,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1861261506, now seen corresponding path program 1 times [2019-03-04 16:26:08,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:08,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:08,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:09,151 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 25 [2019-03-04 16:26:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:09,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:09,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:09,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:09,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:26:09,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:09,302 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 18 treesize of output 21 [2019-03-04 16:26:09,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,311 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 21 treesize of output 23 [2019-03-04 16:26:09,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,316 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 23 treesize of output 25 [2019-03-04 16:26:09,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,326 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 25 treesize of output 27 [2019-03-04 16:26:09,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,341 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:09,342 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,350 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,361 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,371 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,381 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,399 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,399 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:09,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,433 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:09,434 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,453 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:09,453 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:09,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,580 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:09,581 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,602 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:09,602 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:09,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,641 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:09,641 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,660 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:09,660 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:09,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,696 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:09,697 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,717 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:09,717 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:09,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,754 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:09,754 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,774 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:09,774 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:26:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:09,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:09,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-03-04 16:26:09,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:26:09,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:26:09,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:09,817 INFO L87 Difference]: Start difference. First operand 207 states and 1116 transitions. Second operand 13 states. [2019-03-04 16:26:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:11,167 INFO L93 Difference]: Finished difference Result 302 states and 1461 transitions. [2019-03-04 16:26:11,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:26:11,168 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-03-04 16:26:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:11,170 INFO L225 Difference]: With dead ends: 302 [2019-03-04 16:26:11,170 INFO L226 Difference]: Without dead ends: 301 [2019-03-04 16:26:11,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:26:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-03-04 16:26:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 214. [2019-03-04 16:26:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-03-04 16:26:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1158 transitions. [2019-03-04 16:26:11,539 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1158 transitions. Word has length 8 [2019-03-04 16:26:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:11,540 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1158 transitions. [2019-03-04 16:26:11,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:26:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1158 transitions. [2019-03-04 16:26:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:11,540 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:11,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:11,541 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:11,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:11,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1878259866, now seen corresponding path program 1 times [2019-03-04 16:26:11,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:11,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:11,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:11,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:11,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:11,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:11,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:11,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:11,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:26:11,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:11,670 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 18 treesize of output 21 [2019-03-04 16:26:11,682 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 21 treesize of output 26 [2019-03-04 16:26:11,699 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:26:11,730 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:26:11,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:11,759 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 27 treesize of output 35 [2019-03-04 16:26:11,759 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,769 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,779 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,789 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,798 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,810 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:11,811 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-03-04 16:26:11,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:11,833 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:26:11,833 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,839 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:11,840 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-03-04 16:26:11,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:11,887 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-03-04 16:26:11,887 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:11,894 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:11,894 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-03-04 16:26:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:11,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:11,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:11,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:11,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:11,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:11,925 INFO L87 Difference]: Start difference. First operand 214 states and 1158 transitions. Second operand 8 states. [2019-03-04 16:26:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:12,542 INFO L93 Difference]: Finished difference Result 254 states and 1270 transitions. [2019-03-04 16:26:12,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:12,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-03-04 16:26:12,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:12,544 INFO L225 Difference]: With dead ends: 254 [2019-03-04 16:26:12,544 INFO L226 Difference]: Without dead ends: 241 [2019-03-04 16:26:12,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:12,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-03-04 16:26:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 231. [2019-03-04 16:26:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-03-04 16:26:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 1178 transitions. [2019-03-04 16:26:12,925 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 1178 transitions. Word has length 8 [2019-03-04 16:26:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:12,925 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 1178 transitions. [2019-03-04 16:26:12,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:12,925 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 1178 transitions. [2019-03-04 16:26:12,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:12,926 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:12,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:12,926 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:12,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:12,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1864721106, now seen corresponding path program 2 times [2019-03-04 16:26:12,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:12,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:12,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:13,085 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 24 [2019-03-04 16:26:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:13,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:13,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:13,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:13,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:13,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:13,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:26:13,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:13,219 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 18 treesize of output 21 [2019-03-04 16:26:13,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,227 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 21 treesize of output 23 [2019-03-04 16:26:13,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,235 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 23 treesize of output 25 [2019-03-04 16:26:13,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,246 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 25 treesize of output 27 [2019-03-04 16:26:13,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,258 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:13,258 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,269 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,279 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,289 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,299 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,316 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,317 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:13,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,356 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:13,356 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,376 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:13,376 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:13,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,411 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:13,412 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,430 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:13,430 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:13,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,468 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:13,469 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,486 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:13,486 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:26:13,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,522 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:26:13,523 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,542 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:13,542 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:26:13,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:13,577 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:26:13,578 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:13,607 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:13,608 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:26:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:13,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:13,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-03-04 16:26:13,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:26:13,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:26:13,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:13,652 INFO L87 Difference]: Start difference. First operand 231 states and 1178 transitions. Second operand 13 states. [2019-03-04 16:26:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:15,003 INFO L93 Difference]: Finished difference Result 328 states and 1533 transitions. [2019-03-04 16:26:15,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:26:15,003 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-03-04 16:26:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:15,005 INFO L225 Difference]: With dead ends: 328 [2019-03-04 16:26:15,005 INFO L226 Difference]: Without dead ends: 327 [2019-03-04 16:26:15,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:26:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-03-04 16:26:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 257. [2019-03-04 16:26:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-03-04 16:26:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 1332 transitions. [2019-03-04 16:26:15,463 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 1332 transitions. Word has length 8 [2019-03-04 16:26:15,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:15,463 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 1332 transitions. [2019-03-04 16:26:15,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:26:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 1332 transitions. [2019-03-04 16:26:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:15,464 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:15,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:15,464 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:15,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:15,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1868963088, now seen corresponding path program 1 times [2019-03-04 16:26:15,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:15,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:15,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:15,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:15,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:15,611 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:26:15,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:15,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:15,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:15,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:26:15,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:15,645 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 18 treesize of output 21 [2019-03-04 16:26:15,661 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 21 treesize of output 26 [2019-03-04 16:26:15,678 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:26:15,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,698 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:26:15,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,723 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:26:15,724 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,732 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,741 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,751 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,761 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,775 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:15,776 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-03-04 16:26:15,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,810 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:26:15,810 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,820 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,821 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:24 [2019-03-04 16:26:15,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,839 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:26:15,839 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,850 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:15,850 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-03-04 16:26:15,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,873 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:26:15,873 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,884 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:15,884 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:26:15,902 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:26:15,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:15,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:15,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:15,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:15,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:15,922 INFO L87 Difference]: Start difference. First operand 257 states and 1332 transitions. Second operand 10 states. [2019-03-04 16:26:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:16,753 INFO L93 Difference]: Finished difference Result 282 states and 1363 transitions. [2019-03-04 16:26:16,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:16,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:26:16,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:16,754 INFO L225 Difference]: With dead ends: 282 [2019-03-04 16:26:16,755 INFO L226 Difference]: Without dead ends: 275 [2019-03-04 16:26:16,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-03-04 16:26:17,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2019-03-04 16:26:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-03-04 16:26:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 1299 transitions. [2019-03-04 16:26:17,190 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 1299 transitions. Word has length 8 [2019-03-04 16:26:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:17,190 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 1299 transitions. [2019-03-04 16:26:17,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 1299 transitions. [2019-03-04 16:26:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:17,191 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:17,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:17,191 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:17,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:17,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1473696100, now seen corresponding path program 1 times [2019-03-04 16:26:17,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:17,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:17,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:17,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:17,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:17,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:17,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:17,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:17,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:26:17,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:17,329 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 18 treesize of output 21 [2019-03-04 16:26:17,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,335 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 21 treesize of output 23 [2019-03-04 16:26:17,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,342 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 23 treesize of output 25 [2019-03-04 16:26:17,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,352 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 25 treesize of output 27 [2019-03-04 16:26:17,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,367 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:17,367 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:17,377 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:17,388 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:17,398 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:17,408 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:17,426 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:17,427 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:17,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,458 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:17,458 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:17,476 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:17,477 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:17,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,505 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:17,506 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:17,524 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:17,524 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:17,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:17,558 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:17,559 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:17,577 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:17,577 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:17,600 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:26:17,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:17,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:17,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:17,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:17,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:17,619 INFO L87 Difference]: Start difference. First operand 252 states and 1299 transitions. Second operand 10 states. [2019-03-04 16:26:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:18,413 INFO L93 Difference]: Finished difference Result 277 states and 1330 transitions. [2019-03-04 16:26:18,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:18,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:26:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:18,415 INFO L225 Difference]: With dead ends: 277 [2019-03-04 16:26:18,415 INFO L226 Difference]: Without dead ends: 270 [2019-03-04 16:26:18,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-03-04 16:26:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 245. [2019-03-04 16:26:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-03-04 16:26:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 1254 transitions. [2019-03-04 16:26:18,835 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 1254 transitions. Word has length 8 [2019-03-04 16:26:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:18,835 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 1254 transitions. [2019-03-04 16:26:18,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 1254 transitions. [2019-03-04 16:26:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:18,836 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:18,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:18,837 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:18,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:18,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 3 times [2019-03-04 16:26:18,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:18,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:18,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:18,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:18,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:19,112 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-03-04 16:26:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:19,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:19,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:19,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:26:19,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:26:19,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:19,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:26:19,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:19,244 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 18 treesize of output 21 [2019-03-04 16:26:19,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,248 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 21 treesize of output 23 [2019-03-04 16:26:19,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,253 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 23 treesize of output 25 [2019-03-04 16:26:19,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,263 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 25 treesize of output 27 [2019-03-04 16:26:19,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,277 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:19,278 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,288 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,298 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,308 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,318 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,337 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,337 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:19,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,375 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:19,376 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,394 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:19,394 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:19,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,432 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:19,432 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,451 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:19,451 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:19,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,490 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:19,490 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,508 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:19,509 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:26:19,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,544 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:26:19,544 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,564 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:19,564 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:26:19,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:19,604 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:26:19,604 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,623 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:19,624 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:26:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:19,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:19,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:26:19,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:26:19,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:26:19,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:26:19,669 INFO L87 Difference]: Start difference. First operand 245 states and 1254 transitions. Second operand 14 states. [2019-03-04 16:26:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:21,278 INFO L93 Difference]: Finished difference Result 344 states and 1617 transitions. [2019-03-04 16:26:21,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:26:21,278 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-03-04 16:26:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:21,280 INFO L225 Difference]: With dead ends: 344 [2019-03-04 16:26:21,280 INFO L226 Difference]: Without dead ends: 338 [2019-03-04 16:26:21,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:26:21,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-03-04 16:26:21,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 288. [2019-03-04 16:26:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-03-04 16:26:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1511 transitions. [2019-03-04 16:26:21,811 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 1511 transitions. Word has length 8 [2019-03-04 16:26:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:21,811 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 1511 transitions. [2019-03-04 16:26:21,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:26:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 1511 transitions. [2019-03-04 16:26:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:21,812 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:21,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:21,812 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1468154974, now seen corresponding path program 1 times [2019-03-04 16:26:21,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:21,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:21,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:21,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:21,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:21,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:21,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:21,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:26:21,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:21,931 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 18 treesize of output 21 [2019-03-04 16:26:21,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,936 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 21 treesize of output 23 [2019-03-04 16:26:21,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,941 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 23 treesize of output 25 [2019-03-04 16:26:21,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,952 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 25 treesize of output 27 [2019-03-04 16:26:21,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:21,977 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:21,977 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,987 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,998 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,008 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,018 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,037 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:22,037 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:22,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,073 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:22,073 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,092 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:22,093 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:22,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,126 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:22,126 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,146 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:22,146 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:22,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:22,179 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:22,180 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,199 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:22,200 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:22,224 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:26:22,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:22,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:26:22,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:26:22,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:26:22,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:22,252 INFO L87 Difference]: Start difference. First operand 288 states and 1511 transitions. Second operand 9 states. [2019-03-04 16:26:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:23,213 INFO L93 Difference]: Finished difference Result 312 states and 1540 transitions. [2019-03-04 16:26:23,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:23,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:26:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:23,214 INFO L225 Difference]: With dead ends: 312 [2019-03-04 16:26:23,214 INFO L226 Difference]: Without dead ends: 302 [2019-03-04 16:26:23,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:26:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-03-04 16:26:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 279. [2019-03-04 16:26:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-03-04 16:26:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 1458 transitions. [2019-03-04 16:26:23,723 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 1458 transitions. Word has length 8 [2019-03-04 16:26:23,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:23,723 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 1458 transitions. [2019-03-04 16:26:23,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:26:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 1458 transitions. [2019-03-04 16:26:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:23,724 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:23,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:23,724 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:23,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1587664806, now seen corresponding path program 4 times [2019-03-04 16:26:23,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:23,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:23,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:23,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:23,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:23,894 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-03-04 16:26:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:24,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:24,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:24,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:26:24,076 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:26:24,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:24,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:26:24,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:24,079 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 18 treesize of output 21 [2019-03-04 16:26:24,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,082 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 21 treesize of output 23 [2019-03-04 16:26:24,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,088 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 23 treesize of output 25 [2019-03-04 16:26:24,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,098 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 25 treesize of output 27 [2019-03-04 16:26:24,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,112 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:24,113 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,123 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,133 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,143 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,152 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,171 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,171 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:24,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,208 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:24,208 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,227 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:24,228 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:24,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,266 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:24,266 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,285 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:24,286 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-03-04 16:26:24,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,323 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:26:24,324 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,343 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:24,343 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-03-04 16:26:24,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,381 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:26:24,381 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,400 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:24,401 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:26:24,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:24,441 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:26:24,441 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,461 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:24,461 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:26:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:24,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:24,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:26:24,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:26:24,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:26:24,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:26:24,511 INFO L87 Difference]: Start difference. First operand 279 states and 1458 transitions. Second operand 14 states. [2019-03-04 16:26:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:25,973 INFO L93 Difference]: Finished difference Result 307 states and 1498 transitions. [2019-03-04 16:26:25,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:26:25,973 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-03-04 16:26:25,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:25,974 INFO L225 Difference]: With dead ends: 307 [2019-03-04 16:26:25,975 INFO L226 Difference]: Without dead ends: 306 [2019-03-04 16:26:25,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:26:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-03-04 16:26:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 164. [2019-03-04 16:26:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-03-04 16:26:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 806 transitions. [2019-03-04 16:26:26,264 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 806 transitions. Word has length 8 [2019-03-04 16:26:26,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:26,264 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 806 transitions. [2019-03-04 16:26:26,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:26:26,264 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 806 transitions. [2019-03-04 16:26:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:26,264 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:26,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:26,264 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:26,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:26,265 INFO L82 PathProgramCache]: Analyzing trace with hash -716062376, now seen corresponding path program 1 times [2019-03-04 16:26:26,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:26,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:26,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:26,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:26,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:26,462 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-03-04 16:26:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:26,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:26,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:26,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:26,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:26:26,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:26,588 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 18 treesize of output 21 [2019-03-04 16:26:26,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,590 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 21 treesize of output 23 [2019-03-04 16:26:26,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,596 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 23 treesize of output 25 [2019-03-04 16:26:26,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,606 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 25 treesize of output 27 [2019-03-04 16:26:26,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,621 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:26,621 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:26,631 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:26,642 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:26,652 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:26,662 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:26,680 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:26,681 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:26,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,716 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:26,716 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:26,733 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:26,733 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:26,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,772 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:26,772 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:26,791 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:26,792 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:26,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,827 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:26,828 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:26,847 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:26,848 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:26,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:26,882 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:26,882 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:26,900 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:26,900 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:26:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:26,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:26,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:26:26,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:26:26,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:26:26,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:26:26,944 INFO L87 Difference]: Start difference. First operand 164 states and 806 transitions. Second operand 11 states. [2019-03-04 16:26:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:27,851 INFO L93 Difference]: Finished difference Result 189 states and 850 transitions. [2019-03-04 16:26:27,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:27,852 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:26:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:27,853 INFO L225 Difference]: With dead ends: 189 [2019-03-04 16:26:27,853 INFO L226 Difference]: Without dead ends: 186 [2019-03-04 16:26:27,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:26:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-03-04 16:26:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 157. [2019-03-04 16:26:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-03-04 16:26:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 765 transitions. [2019-03-04 16:26:28,137 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 765 transitions. Word has length 8 [2019-03-04 16:26:28,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:28,137 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 765 transitions. [2019-03-04 16:26:28,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:26:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 765 transitions. [2019-03-04 16:26:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:28,138 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:28,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:28,138 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:28,138 INFO L82 PathProgramCache]: Analyzing trace with hash -712249128, now seen corresponding path program 1 times [2019-03-04 16:26:28,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:28,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:28,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:28,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:28,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:28,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:28,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:28,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:28,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:26:28,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:28,325 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 18 treesize of output 21 [2019-03-04 16:26:28,476 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 21 treesize of output 26 [2019-03-04 16:26:28,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,654 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:26:28,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,924 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:26:28,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,089 INFO L301 Elim1Store]: Index analysis took 140 ms [2019-03-04 16:26:29,242 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:29,243 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,391 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,535 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,574 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,583 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,599 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:29,600 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:26:29,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,640 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:29,640 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,654 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:29,655 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:26:29,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,682 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:29,682 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,697 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:29,697 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:26:29,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,722 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:26:29,722 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,737 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:29,737 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:26:29,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:29,764 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:26:29,764 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,779 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:29,779 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:26:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:29,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:29,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:26:29,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:26:29,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:26:29,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:29,817 INFO L87 Difference]: Start difference. First operand 157 states and 765 transitions. Second operand 12 states. [2019-03-04 16:26:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:30,853 INFO L93 Difference]: Finished difference Result 233 states and 1009 transitions. [2019-03-04 16:26:30,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:26:30,853 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-03-04 16:26:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:30,854 INFO L225 Difference]: With dead ends: 233 [2019-03-04 16:26:30,854 INFO L226 Difference]: Without dead ends: 230 [2019-03-04 16:26:30,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:26:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-03-04 16:26:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 156. [2019-03-04 16:26:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-03-04 16:26:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 761 transitions. [2019-03-04 16:26:31,158 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 761 transitions. Word has length 8 [2019-03-04 16:26:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:31,158 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 761 transitions. [2019-03-04 16:26:31,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 761 transitions. [2019-03-04 16:26:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:31,158 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:31,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:31,159 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1048410772, now seen corresponding path program 1 times [2019-03-04 16:26:31,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:31,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:31,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:31,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:31,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:31,317 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-03-04 16:26:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:31,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:31,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:31,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:31,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:26:31,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:31,392 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 18 treesize of output 21 [2019-03-04 16:26:31,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,395 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 21 treesize of output 23 [2019-03-04 16:26:31,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,402 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 23 treesize of output 25 [2019-03-04 16:26:31,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,412 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 25 treesize of output 27 [2019-03-04 16:26:31,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,426 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:31,427 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,437 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,447 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,457 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,467 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,485 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:31,485 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:31,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,520 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:31,520 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,539 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:31,540 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:31,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,574 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:31,575 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,594 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:31,594 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:31,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,629 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:31,629 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,648 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:31,649 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:31,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:31,687 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:31,687 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,707 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:31,707 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:31,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:31,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:26:31,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:26:31,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:26:31,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:26:31,747 INFO L87 Difference]: Start difference. First operand 156 states and 761 transitions. Second operand 11 states. [2019-03-04 16:26:32,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:32,738 INFO L93 Difference]: Finished difference Result 190 states and 884 transitions. [2019-03-04 16:26:32,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:32,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:26:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:32,740 INFO L225 Difference]: With dead ends: 190 [2019-03-04 16:26:32,740 INFO L226 Difference]: Without dead ends: 187 [2019-03-04 16:26:32,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:26:32,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-03-04 16:26:33,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 158. [2019-03-04 16:26:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-03-04 16:26:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 771 transitions. [2019-03-04 16:26:33,065 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 771 transitions. Word has length 8 [2019-03-04 16:26:33,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:33,065 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 771 transitions. [2019-03-04 16:26:33,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:26:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 771 transitions. [2019-03-04 16:26:33,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:33,065 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:33,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:33,066 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:33,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:33,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1055499044, now seen corresponding path program 1 times [2019-03-04 16:26:33,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:33,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:33,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:33,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:33,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:33,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:33,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:33,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:33,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:26:33,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:33,209 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 18 treesize of output 21 [2019-03-04 16:26:33,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,219 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 21 treesize of output 23 [2019-03-04 16:26:33,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,230 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 23 treesize of output 25 [2019-03-04 16:26:33,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,246 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 25 treesize of output 27 [2019-03-04 16:26:33,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,259 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:33,259 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:33,269 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:33,279 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:33,290 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:33,300 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:33,319 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:33,319 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:33,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,353 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:33,354 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:33,371 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:33,371 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:33,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,404 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:33,404 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:33,423 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:33,423 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:33,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,455 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:33,455 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:33,475 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:33,475 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:33,499 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:26:33,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:33,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:26:33,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:26:33,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:26:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:33,517 INFO L87 Difference]: Start difference. First operand 158 states and 771 transitions. Second operand 9 states. [2019-03-04 16:26:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:34,281 INFO L93 Difference]: Finished difference Result 175 states and 801 transitions. [2019-03-04 16:26:34,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:34,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:26:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:34,283 INFO L225 Difference]: With dead ends: 175 [2019-03-04 16:26:34,283 INFO L226 Difference]: Without dead ends: 174 [2019-03-04 16:26:34,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:34,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-03-04 16:26:34,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 156. [2019-03-04 16:26:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-03-04 16:26:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 759 transitions. [2019-03-04 16:26:34,607 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 759 transitions. Word has length 8 [2019-03-04 16:26:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:34,607 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 759 transitions. [2019-03-04 16:26:34,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:26:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 759 transitions. [2019-03-04 16:26:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:34,607 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:34,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:34,608 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:34,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:34,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1051985692, now seen corresponding path program 2 times [2019-03-04 16:26:34,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:34,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:34,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:34,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:34,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:34,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:34,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:34,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:34,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:34,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:34,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:26:34,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:34,789 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 18 treesize of output 21 [2019-03-04 16:26:34,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,797 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 21 treesize of output 23 [2019-03-04 16:26:34,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,802 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 23 treesize of output 25 [2019-03-04 16:26:34,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,812 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 25 treesize of output 27 [2019-03-04 16:26:34,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:34,827 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,837 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,847 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,857 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,868 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,886 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:34,887 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:34,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,925 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:34,925 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,944 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:34,945 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:34,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,985 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:34,986 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,004 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:35,005 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:35,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,041 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:35,042 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,061 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:35,061 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:35,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,101 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:35,102 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,121 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:35,121 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:35,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:35,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:26:35,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:26:35,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:26:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:35,164 INFO L87 Difference]: Start difference. First operand 156 states and 759 transitions. Second operand 12 states. [2019-03-04 16:26:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:36,122 INFO L93 Difference]: Finished difference Result 180 states and 815 transitions. [2019-03-04 16:26:36,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:36,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-03-04 16:26:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:36,123 INFO L225 Difference]: With dead ends: 180 [2019-03-04 16:26:36,123 INFO L226 Difference]: Without dead ends: 173 [2019-03-04 16:26:36,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:26:36,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-03-04 16:26:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 155. [2019-03-04 16:26:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-03-04 16:26:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 753 transitions. [2019-03-04 16:26:36,457 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 753 transitions. Word has length 8 [2019-03-04 16:26:36,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:36,457 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 753 transitions. [2019-03-04 16:26:36,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 753 transitions. [2019-03-04 16:26:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:36,457 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:36,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:36,458 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:36,458 INFO L82 PathProgramCache]: Analyzing trace with hash -927991578, now seen corresponding path program 1 times [2019-03-04 16:26:36,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:36,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:36,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:36,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:36,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:36,518 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:26:36,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:36,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:36,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:36,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:26:36,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:36,537 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 18 treesize of output 21 [2019-03-04 16:26:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:26:36,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,571 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:26:36,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,588 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:26:36,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,607 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:36,607 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:36,615 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:36,625 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:36,636 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:36,646 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:36,662 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:36,663 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:26:36,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,693 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:36,693 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:36,708 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:36,708 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:26:36,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:36,731 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:36,732 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:36,748 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:36,748 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:26:36,767 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:26:36,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:36,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:36,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:36,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:36,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:36,787 INFO L87 Difference]: Start difference. First operand 155 states and 753 transitions. Second operand 8 states. [2019-03-04 16:26:37,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:37,450 INFO L93 Difference]: Finished difference Result 180 states and 801 transitions. [2019-03-04 16:26:37,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:37,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-03-04 16:26:37,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:37,451 INFO L225 Difference]: With dead ends: 180 [2019-03-04 16:26:37,451 INFO L226 Difference]: Without dead ends: 167 [2019-03-04 16:26:37,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:37,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-03-04 16:26:37,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-03-04 16:26:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-03-04 16:26:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 767 transitions. [2019-03-04 16:26:37,806 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 767 transitions. Word has length 8 [2019-03-04 16:26:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:37,806 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 767 transitions. [2019-03-04 16:26:37,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:37,806 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 767 transitions. [2019-03-04 16:26:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:37,807 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:37,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:37,807 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:37,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:37,807 INFO L82 PathProgramCache]: Analyzing trace with hash -937469088, now seen corresponding path program 2 times [2019-03-04 16:26:37,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:37,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:37,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:37,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:37,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:37,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:37,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:37,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:37,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:37,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:37,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:26:37,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:38,010 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 18 treesize of output 21 [2019-03-04 16:26:38,162 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 21 treesize of output 26 [2019-03-04 16:26:38,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,218 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:26:38,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,233 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:26:38,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,253 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:38,254 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:38,262 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:38,272 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:38,282 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:38,292 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:38,309 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:38,309 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:26:38,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,349 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:38,350 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:38,363 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:38,363 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:26:38,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,391 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:38,392 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:38,406 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:38,406 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:26:38,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,438 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:26:38,438 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:38,451 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:38,451 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:26:38,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:38,482 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:26:38,482 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:38,497 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:38,497 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:26:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:38,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:38,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:26:38,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:26:38,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:26:38,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:38,539 INFO L87 Difference]: Start difference. First operand 158 states and 767 transitions. Second operand 12 states. [2019-03-04 16:26:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:39,701 INFO L93 Difference]: Finished difference Result 234 states and 1018 transitions. [2019-03-04 16:26:39,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:39,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-03-04 16:26:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:39,703 INFO L225 Difference]: With dead ends: 234 [2019-03-04 16:26:39,703 INFO L226 Difference]: Without dead ends: 227 [2019-03-04 16:26:39,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:26:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-03-04 16:26:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 165. [2019-03-04 16:26:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-03-04 16:26:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 809 transitions. [2019-03-04 16:26:40,116 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 809 transitions. Word has length 8 [2019-03-04 16:26:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:40,116 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 809 transitions. [2019-03-04 16:26:40,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 809 transitions. [2019-03-04 16:26:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:40,116 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:40,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:40,116 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:40,117 INFO L82 PathProgramCache]: Analyzing trace with hash -819496728, now seen corresponding path program 3 times [2019-03-04 16:26:40,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:40,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:40,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:40,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:40,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:40,527 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 20 [2019-03-04 16:26:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:40,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:40,616 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:40,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:26:40,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:26:40,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:40,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:26:40,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:40,660 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 18 treesize of output 21 [2019-03-04 16:26:40,668 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 21 treesize of output 26 [2019-03-04 16:26:40,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,680 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:26:40,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,697 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:26:40,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,715 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:40,716 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:40,725 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:40,735 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:40,743 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:40,754 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:40,770 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:40,771 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:26:40,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,813 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:40,813 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:40,828 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:40,828 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:26:40,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,858 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:40,859 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:40,872 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:40,872 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:26:40,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,903 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:40,904 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:40,918 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:40,918 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:26:40,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:40,962 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:26:40,963 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:40,983 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:40,984 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:26:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:41,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:41,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:26:41,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:26:41,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:26:41,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:41,038 INFO L87 Difference]: Start difference. First operand 165 states and 809 transitions. Second operand 12 states. [2019-03-04 16:26:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:42,123 INFO L93 Difference]: Finished difference Result 209 states and 913 transitions. [2019-03-04 16:26:42,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:42,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-03-04 16:26:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:42,125 INFO L225 Difference]: With dead ends: 209 [2019-03-04 16:26:42,125 INFO L226 Difference]: Without dead ends: 208 [2019-03-04 16:26:42,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:26:42,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-03-04 16:26:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 145. [2019-03-04 16:26:42,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-03-04 16:26:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 694 transitions. [2019-03-04 16:26:42,503 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 694 transitions. Word has length 8 [2019-03-04 16:26:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:42,504 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 694 transitions. [2019-03-04 16:26:42,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 694 transitions. [2019-03-04 16:26:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:42,504 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:42,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:42,504 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:42,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:42,504 INFO L82 PathProgramCache]: Analyzing trace with hash -826465836, now seen corresponding path program 1 times [2019-03-04 16:26:42,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:42,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:42,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:42,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:42,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:42,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:42,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:42,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:42,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:26:42,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:42,697 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 18 treesize of output 21 [2019-03-04 16:26:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:26:42,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,720 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:26:42,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,735 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:26:42,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,753 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:42,754 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,762 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,771 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,781 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,791 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,807 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:42,807 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:26:42,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,886 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:42,886 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,901 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:42,901 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:26:42,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,927 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:42,928 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,942 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:42,942 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:26:42,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,970 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:42,971 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,985 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:42,986 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:26:43,009 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:26:43,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:43,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:26:43,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:26:43,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:26:43,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:43,030 INFO L87 Difference]: Start difference. First operand 145 states and 694 transitions. Second operand 9 states. [2019-03-04 16:26:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:43,737 INFO L93 Difference]: Finished difference Result 164 states and 732 transitions. [2019-03-04 16:26:43,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:43,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:26:43,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:43,738 INFO L225 Difference]: With dead ends: 164 [2019-03-04 16:26:43,738 INFO L226 Difference]: Without dead ends: 157 [2019-03-04 16:26:43,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-03-04 16:26:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2019-03-04 16:26:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-03-04 16:26:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 701 transitions. [2019-03-04 16:26:44,148 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 701 transitions. Word has length 8 [2019-03-04 16:26:44,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:44,148 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 701 transitions. [2019-03-04 16:26:44,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:26:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 701 transitions. [2019-03-04 16:26:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:44,149 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:44,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:44,149 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash -252398774, now seen corresponding path program 1 times [2019-03-04 16:26:44,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:44,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:44,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:44,409 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-03-04 16:26:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:44,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:44,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:44,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:44,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:26:44,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:44,494 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 18 treesize of output 21 [2019-03-04 16:26:44,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,497 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 21 treesize of output 23 [2019-03-04 16:26:44,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,504 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 23 treesize of output 25 [2019-03-04 16:26:44,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,514 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 25 treesize of output 27 [2019-03-04 16:26:44,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,529 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:44,530 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,540 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,551 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,561 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,572 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,590 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:44,590 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:44,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,626 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:44,626 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,645 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:44,646 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:44,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,684 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:44,684 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,703 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:44,703 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:44,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:44,741 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,760 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:44,761 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:26:44,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:44,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:26:44,795 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:44,814 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:44,814 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:26:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:44,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:44,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:26:44,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:26:44,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:26:44,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:26:44,854 INFO L87 Difference]: Start difference. First operand 146 states and 701 transitions. Second operand 11 states. [2019-03-04 16:26:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:45,943 INFO L93 Difference]: Finished difference Result 213 states and 913 transitions. [2019-03-04 16:26:45,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:45,943 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:26:45,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:45,945 INFO L225 Difference]: With dead ends: 213 [2019-03-04 16:26:45,945 INFO L226 Difference]: Without dead ends: 212 [2019-03-04 16:26:45,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:26:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-03-04 16:26:46,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 151. [2019-03-04 16:26:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-03-04 16:26:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 731 transitions. [2019-03-04 16:26:46,369 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 731 transitions. Word has length 8 [2019-03-04 16:26:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:46,370 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 731 transitions. [2019-03-04 16:26:46,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:26:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 731 transitions. [2019-03-04 16:26:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:46,370 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:46,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:46,370 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:46,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:46,371 INFO L82 PathProgramCache]: Analyzing trace with hash -191146492, now seen corresponding path program 1 times [2019-03-04 16:26:46,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:46,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:46,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:46,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:46,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:46,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:46,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:46,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:46,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:26:46,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:46,553 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 18 treesize of output 21 [2019-03-04 16:26:46,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,556 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 21 treesize of output 23 [2019-03-04 16:26:46,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,563 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 23 treesize of output 25 [2019-03-04 16:26:46,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,574 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 25 treesize of output 27 [2019-03-04 16:26:46,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,589 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:46,589 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:46,599 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:46,609 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:46,619 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:46,627 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:46,646 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:46,647 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:46,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,682 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:46,683 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:46,702 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:46,702 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:46,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,737 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:46,738 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:46,755 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:46,756 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:46,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:46,791 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:46,791 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:46,827 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:46,827 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:46,852 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:26:46,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:46,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:26:46,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:26:46,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:26:46,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:46,871 INFO L87 Difference]: Start difference. First operand 151 states and 731 transitions. Second operand 9 states. [2019-03-04 16:26:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:47,661 INFO L93 Difference]: Finished difference Result 162 states and 760 transitions. [2019-03-04 16:26:47,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:47,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:26:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:47,662 INFO L225 Difference]: With dead ends: 162 [2019-03-04 16:26:47,662 INFO L226 Difference]: Without dead ends: 155 [2019-03-04 16:26:47,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-03-04 16:26:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2019-03-04 16:26:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-03-04 16:26:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 714 transitions. [2019-03-04 16:26:48,076 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 714 transitions. Word has length 8 [2019-03-04 16:26:48,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:48,076 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 714 transitions. [2019-03-04 16:26:48,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:26:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 714 transitions. [2019-03-04 16:26:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:48,077 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:48,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:48,077 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:48,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:48,077 INFO L82 PathProgramCache]: Analyzing trace with hash -477618734, now seen corresponding path program 2 times [2019-03-04 16:26:48,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:48,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:48,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:48,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:48,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:26:48,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:48,256 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:48,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:48,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:48,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:48,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:26:48,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:48,274 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 18 treesize of output 21 [2019-03-04 16:26:48,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,280 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 21 treesize of output 23 [2019-03-04 16:26:48,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,285 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 23 treesize of output 25 [2019-03-04 16:26:48,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,295 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 25 treesize of output 27 [2019-03-04 16:26:48,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,311 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:48,311 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,321 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,332 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,342 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,353 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,373 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:48,374 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:48,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,411 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:48,411 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,430 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:48,431 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:48,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,471 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:48,471 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,490 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:48,491 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:48,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:48,529 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,549 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:48,549 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:48,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:48,588 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:48,589 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,608 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:48,609 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:26:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:48,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:48,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:26:48,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:26:48,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:26:48,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:48,665 INFO L87 Difference]: Start difference. First operand 148 states and 714 transitions. Second operand 12 states. [2019-03-04 16:26:49,329 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-03-04 16:26:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:50,325 INFO L93 Difference]: Finished difference Result 209 states and 880 transitions. [2019-03-04 16:26:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:50,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-03-04 16:26:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:50,327 INFO L225 Difference]: With dead ends: 209 [2019-03-04 16:26:50,327 INFO L226 Difference]: Without dead ends: 207 [2019-03-04 16:26:50,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:26:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-03-04 16:26:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 134. [2019-03-04 16:26:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-03-04 16:26:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 637 transitions. [2019-03-04 16:26:50,718 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 637 transitions. Word has length 8 [2019-03-04 16:26:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:50,718 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 637 transitions. [2019-03-04 16:26:50,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 637 transitions. [2019-03-04 16:26:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:50,719 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:50,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:50,719 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:50,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:50,719 INFO L82 PathProgramCache]: Analyzing trace with hash -366615482, now seen corresponding path program 1 times [2019-03-04 16:26:50,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:50,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:50,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:50,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:50,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:26:50,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:50,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:50,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:50,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:26:50,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:50,858 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 18 treesize of output 21 [2019-03-04 16:26:50,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,866 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 21 treesize of output 23 [2019-03-04 16:26:50,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,874 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 23 treesize of output 25 [2019-03-04 16:26:50,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,887 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 25 treesize of output 27 [2019-03-04 16:26:50,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,901 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:50,902 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,912 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,922 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,932 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,942 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,960 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:50,960 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:50,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,994 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:50,995 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:51,014 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:51,014 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:51,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,048 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:51,048 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:51,067 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:51,067 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:26:51,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:51,125 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:51,126 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:51,142 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:51,142 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:51,167 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:26:51,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:51,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:26:51,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:26:51,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:26:51,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:51,187 INFO L87 Difference]: Start difference. First operand 134 states and 637 transitions. Second operand 9 states. [2019-03-04 16:26:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:52,061 INFO L93 Difference]: Finished difference Result 151 states and 667 transitions. [2019-03-04 16:26:52,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:52,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:26:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:52,062 INFO L225 Difference]: With dead ends: 151 [2019-03-04 16:26:52,062 INFO L226 Difference]: Without dead ends: 150 [2019-03-04 16:26:52,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-03-04 16:26:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 134. [2019-03-04 16:26:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-03-04 16:26:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 637 transitions. [2019-03-04 16:26:52,447 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 637 transitions. Word has length 8 [2019-03-04 16:26:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:52,447 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 637 transitions. [2019-03-04 16:26:52,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:26:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 637 transitions. [2019-03-04 16:26:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:52,447 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:52,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:52,447 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:52,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:52,448 INFO L82 PathProgramCache]: Analyzing trace with hash -987816240, now seen corresponding path program 1 times [2019-03-04 16:26:52,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:52,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:52,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:52,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:52,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:52,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:52,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:52,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:52,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:26:52,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:52,581 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 18 treesize of output 21 [2019-03-04 16:26:52,593 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 21 treesize of output 26 [2019-03-04 16:26:52,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,606 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:26:52,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,621 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:26:52,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,639 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:52,639 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:52,649 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:52,659 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:52,669 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:52,679 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:52,694 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:52,695 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:26:52,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,733 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:52,734 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:52,748 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:52,748 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:26:52,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,773 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:26:52,773 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:52,788 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:52,788 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:26:52,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,815 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:26:52,816 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:52,830 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:52,830 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:26:52,854 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:26:52,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:52,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:52,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:52,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:52,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:52,874 INFO L87 Difference]: Start difference. First operand 134 states and 637 transitions. Second operand 10 states. [2019-03-04 16:26:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:53,703 INFO L93 Difference]: Finished difference Result 156 states and 671 transitions. [2019-03-04 16:26:53,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:53,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:26:53,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:53,704 INFO L225 Difference]: With dead ends: 156 [2019-03-04 16:26:53,705 INFO L226 Difference]: Without dead ends: 150 [2019-03-04 16:26:53,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-03-04 16:26:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 134. [2019-03-04 16:26:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-03-04 16:26:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 636 transitions. [2019-03-04 16:26:54,098 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 636 transitions. Word has length 8 [2019-03-04 16:26:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:54,098 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 636 transitions. [2019-03-04 16:26:54,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 636 transitions. [2019-03-04 16:26:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:54,099 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:54,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:54,099 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:54,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:54,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1000745534, now seen corresponding path program 1 times [2019-03-04 16:26:54,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:54,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:54,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:54,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:54,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:54,211 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:26:54,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:54,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:54,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:54,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:26:54,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:54,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 18 treesize of output 21 [2019-03-04 16:26:54,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,240 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 21 treesize of output 23 [2019-03-04 16:26:54,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,245 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 23 treesize of output 25 [2019-03-04 16:26:54,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,253 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 25 treesize of output 27 [2019-03-04 16:26:54,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,268 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:54,268 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,279 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,289 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,300 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,310 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,329 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:54,329 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:54,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,425 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:54,425 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,444 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:54,445 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:54,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,477 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:54,478 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,497 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:54,497 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-03-04 16:26:54,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:54,528 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:26:54,529 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:54,548 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:54,548 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:26:54,570 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:26:54,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:54,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:54,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:54,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:54,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:54,590 INFO L87 Difference]: Start difference. First operand 134 states and 636 transitions. Second operand 10 states. [2019-03-04 16:26:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:55,394 INFO L93 Difference]: Finished difference Result 159 states and 689 transitions. [2019-03-04 16:26:55,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:55,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:26:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:55,396 INFO L225 Difference]: With dead ends: 159 [2019-03-04 16:26:55,397 INFO L226 Difference]: Without dead ends: 158 [2019-03-04 16:26:55,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-03-04 16:26:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2019-03-04 16:26:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-03-04 16:26:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 660 transitions. [2019-03-04 16:26:55,879 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 660 transitions. Word has length 8 [2019-03-04 16:26:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:55,879 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 660 transitions. [2019-03-04 16:26:55,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 660 transitions. [2019-03-04 16:26:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:55,880 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:55,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:55,880 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:55,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1327610400, now seen corresponding path program 1 times [2019-03-04 16:26:55,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:55,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:55,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:56,362 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-03-04 16:26:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:56,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:56,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:56,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:56,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:26:56,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:56,538 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 18 treesize of output 21 [2019-03-04 16:26:56,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,543 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 21 treesize of output 23 [2019-03-04 16:26:56,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,553 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 23 treesize of output 25 [2019-03-04 16:26:56,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,566 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 25 treesize of output 27 [2019-03-04 16:26:56,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,582 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:56,582 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,592 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,602 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,612 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,623 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,642 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:56,642 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:26:56,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,671 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:56,671 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,689 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:56,689 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:26:56,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,718 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:26:56,718 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,737 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:56,738 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:26:56,767 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:26:56,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:56,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:26:56,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:26:56,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:26:56,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:26:56,785 INFO L87 Difference]: Start difference. First operand 138 states and 660 transitions. Second operand 7 states. [2019-03-04 16:26:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:57,516 INFO L93 Difference]: Finished difference Result 148 states and 674 transitions. [2019-03-04 16:26:57,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:57,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-03-04 16:26:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:57,518 INFO L225 Difference]: With dead ends: 148 [2019-03-04 16:26:57,518 INFO L226 Difference]: Without dead ends: 139 [2019-03-04 16:26:57,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-03-04 16:26:57,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-03-04 16:26:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-03-04 16:26:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 649 transitions. [2019-03-04 16:26:57,991 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 649 transitions. Word has length 8 [2019-03-04 16:26:57,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:57,991 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 649 transitions. [2019-03-04 16:26:57,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:26:57,991 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 649 transitions. [2019-03-04 16:26:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:26:57,992 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:57,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:57,992 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:57,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:57,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-03-04 16:26:57,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:57,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:57,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:57,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:57,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:58,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:58,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:58,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:58,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:26:58,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:58,098 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 18 treesize of output 21 [2019-03-04 16:26:58,112 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 21 treesize of output 26 [2019-03-04 16:26:58,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,124 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:26:58,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,140 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:26:58,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,159 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:58,160 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,170 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,180 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,190 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,200 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,217 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:58,217 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:26:58,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,252 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:58,252 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,267 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:58,267 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:26:58,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,289 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:26:58,290 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,304 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:58,305 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:26:58,324 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:26:58,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:58,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:26:58,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:26:58,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:26:58,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:26:58,343 INFO L87 Difference]: Start difference. First operand 136 states and 649 transitions. Second operand 7 states. [2019-03-04 16:26:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:59,028 INFO L93 Difference]: Finished difference Result 146 states and 663 transitions. [2019-03-04 16:26:59,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:59,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-03-04 16:26:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:59,029 INFO L225 Difference]: With dead ends: 146 [2019-03-04 16:26:59,029 INFO L226 Difference]: Without dead ends: 137 [2019-03-04 16:26:59,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:59,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-03-04 16:26:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-03-04 16:26:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-03-04 16:26:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 648 transitions. [2019-03-04 16:26:59,455 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 648 transitions. Word has length 8 [2019-03-04 16:26:59,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:59,455 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 648 transitions. [2019-03-04 16:26:59,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:26:59,456 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 648 transitions. [2019-03-04 16:26:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:26:59,456 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:59,456 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:59,456 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:59,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:59,458 INFO L82 PathProgramCache]: Analyzing trace with hash 213756976, now seen corresponding path program 1 times [2019-03-04 16:26:59,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:59,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:59,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:59,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:59,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:26:59,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:59,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:26:59,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:59,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:26:59,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:26:59,610 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 21 treesize of output 26 [2019-03-04 16:26:59,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,624 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:26:59,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,639 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:26:59,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:59,660 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,670 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,680 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,690 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,700 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,716 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:59,717 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:26:59,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,754 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:26:59,755 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,769 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:59,769 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:26:59,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:26:59,794 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,808 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:59,809 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:26:59,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:59,832 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:26:59,833 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,847 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:59,848 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:26:59,869 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:26:59,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:59,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:26:59,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:26:59,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:26:59,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:59,887 INFO L87 Difference]: Start difference. First operand 136 states and 648 transitions. Second operand 9 states. [2019-03-04 16:27:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:00,625 INFO L93 Difference]: Finished difference Result 147 states and 667 transitions. [2019-03-04 16:27:00,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:27:00,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-03-04 16:27:00,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:00,627 INFO L225 Difference]: With dead ends: 147 [2019-03-04 16:27:00,627 INFO L226 Difference]: Without dead ends: 138 [2019-03-04 16:27:00,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:27:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-03-04 16:27:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2019-03-04 16:27:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-03-04 16:27:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 640 transitions. [2019-03-04 16:27:01,052 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 640 transitions. Word has length 9 [2019-03-04 16:27:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:01,053 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 640 transitions. [2019-03-04 16:27:01,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:27:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 640 transitions. [2019-03-04 16:27:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:01,053 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:01,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:01,054 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:01,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:01,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1864950956, now seen corresponding path program 1 times [2019-03-04 16:27:01,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:01,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:01,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:01,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:01,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:01,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:01,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:01,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:01,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:27:01,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:01,237 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 18 treesize of output 21 [2019-03-04 16:27:01,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,246 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 21 treesize of output 23 [2019-03-04 16:27:01,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,258 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 23 treesize of output 25 [2019-03-04 16:27:01,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,269 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 25 treesize of output 27 [2019-03-04 16:27:01,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,283 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:01,283 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:01,294 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:01,304 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:01,314 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:01,324 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:01,343 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:01,343 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:01,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,378 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:01,378 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:01,397 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:01,398 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:01,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,443 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:01,444 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:01,474 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:01,475 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:27:01,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,526 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:01,526 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:01,545 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:01,545 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:27:01,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:01,593 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:01,593 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:01,614 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:01,614 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:27:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:01,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:01,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:27:01,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:27:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:27:01,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:27:01,665 INFO L87 Difference]: Start difference. First operand 135 states and 640 transitions. Second operand 11 states. [2019-03-04 16:27:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:02,885 INFO L93 Difference]: Finished difference Result 187 states and 796 transitions. [2019-03-04 16:27:02,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:27:02,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:27:02,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:02,886 INFO L225 Difference]: With dead ends: 187 [2019-03-04 16:27:02,887 INFO L226 Difference]: Without dead ends: 177 [2019-03-04 16:27:02,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:27:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-03-04 16:27:03,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 100. [2019-03-04 16:27:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-03-04 16:27:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 456 transitions. [2019-03-04 16:27:03,326 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 456 transitions. Word has length 9 [2019-03-04 16:27:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:03,326 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 456 transitions. [2019-03-04 16:27:03,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:27:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 456 transitions. [2019-03-04 16:27:03,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:03,327 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:03,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:03,327 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:03,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:03,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1989953630, now seen corresponding path program 1 times [2019-03-04 16:27:03,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:03,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:03,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:03,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:03,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:03,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:03,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:03,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:03,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:27:03,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:03,473 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 18 treesize of output 21 [2019-03-04 16:27:03,491 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 21 treesize of output 26 [2019-03-04 16:27:03,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,508 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:27:03,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,522 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:27:03,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,542 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:03,543 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,553 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,563 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,573 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,582 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,598 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:03,599 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:27:03,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,634 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:27:03,634 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,649 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:03,649 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:27:03,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,675 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:27:03,675 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,690 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:03,690 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:27:03,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,714 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:27:03,714 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,729 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:03,729 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:27:03,748 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:27:03,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:03,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:27:03,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:27:03,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:27:03,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:03,766 INFO L87 Difference]: Start difference. First operand 100 states and 456 transitions. Second operand 10 states. [2019-03-04 16:27:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:04,838 INFO L93 Difference]: Finished difference Result 156 states and 680 transitions. [2019-03-04 16:27:04,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:27:04,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:27:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:04,839 INFO L225 Difference]: With dead ends: 156 [2019-03-04 16:27:04,839 INFO L226 Difference]: Without dead ends: 147 [2019-03-04 16:27:04,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:27:04,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-03-04 16:27:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2019-03-04 16:27:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-03-04 16:27:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 605 transitions. [2019-03-04 16:27:05,501 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 605 transitions. Word has length 9 [2019-03-04 16:27:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:05,501 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 605 transitions. [2019-03-04 16:27:05,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:27:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 605 transitions. [2019-03-04 16:27:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:05,502 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:05,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:05,502 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:05,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:05,502 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-03-04 16:27:05,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:05,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:05,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:27:05,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:05,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:05,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:05,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:27:05,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:05,644 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 18 treesize of output 21 [2019-03-04 16:27:05,660 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 21 treesize of output 26 [2019-03-04 16:27:05,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,676 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:27:05,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:27:05,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,712 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:05,712 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,723 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,733 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,743 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,753 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,768 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:05,768 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:27:05,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,808 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:27:05,809 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,823 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:05,823 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:27:05,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,848 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:27:05,849 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,863 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:05,863 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:27:05,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:05,888 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:27:05,888 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,903 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:05,903 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:27:05,925 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:27:05,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:05,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:27:05,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:27:05,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:27:05,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:27:05,945 INFO L87 Difference]: Start difference. First operand 130 states and 605 transitions. Second operand 9 states. [2019-03-04 16:27:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:06,973 INFO L93 Difference]: Finished difference Result 143 states and 635 transitions. [2019-03-04 16:27:06,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:27:06,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-03-04 16:27:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:06,974 INFO L225 Difference]: With dead ends: 143 [2019-03-04 16:27:06,975 INFO L226 Difference]: Without dead ends: 134 [2019-03-04 16:27:06,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-03-04 16:27:07,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-03-04 16:27:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-03-04 16:27:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 613 transitions. [2019-03-04 16:27:07,671 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 613 transitions. Word has length 9 [2019-03-04 16:27:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:07,671 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 613 transitions. [2019-03-04 16:27:07,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:27:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 613 transitions. [2019-03-04 16:27:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:07,672 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:07,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:07,672 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:07,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:07,672 INFO L82 PathProgramCache]: Analyzing trace with hash -595589650, now seen corresponding path program 2 times [2019-03-04 16:27:07,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:07,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:07,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:07,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:07,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:07,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:07,794 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:07,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:07,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:07,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:07,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:27:07,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:07,813 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 18 treesize of output 21 [2019-03-04 16:27:07,831 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 21 treesize of output 26 [2019-03-04 16:27:07,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,846 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:27:07,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,864 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:27:07,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,881 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:07,882 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,890 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,901 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,911 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,921 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,937 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:07,938 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:27:07,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:07,990 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:27:07,991 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,005 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:08,006 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:27:08,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:27:08,033 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,048 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:08,048 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:27:08,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,073 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:27:08,073 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,088 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:08,088 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:27:08,110 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:27:08,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:08,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:27:08,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:27:08,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:27:08,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:08,129 INFO L87 Difference]: Start difference. First operand 132 states and 613 transitions. Second operand 10 states. [2019-03-04 16:27:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:09,383 INFO L93 Difference]: Finished difference Result 193 states and 831 transitions. [2019-03-04 16:27:09,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:27:09,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:27:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:09,385 INFO L225 Difference]: With dead ends: 193 [2019-03-04 16:27:09,385 INFO L226 Difference]: Without dead ends: 182 [2019-03-04 16:27:09,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-03-04 16:27:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 136. [2019-03-04 16:27:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-03-04 16:27:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 629 transitions. [2019-03-04 16:27:10,143 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 629 transitions. Word has length 9 [2019-03-04 16:27:10,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:10,143 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 629 transitions. [2019-03-04 16:27:10,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:27:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 629 transitions. [2019-03-04 16:27:10,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:10,144 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:10,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:10,144 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:10,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:10,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1855010516, now seen corresponding path program 1 times [2019-03-04 16:27:10,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:10,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:10,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:10,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:10,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:10,348 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-03-04 16:27:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:10,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:10,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:10,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:10,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:27:10,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:10,489 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 18 treesize of output 21 [2019-03-04 16:27:10,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,492 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 21 treesize of output 23 [2019-03-04 16:27:10,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,498 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 23 treesize of output 25 [2019-03-04 16:27:10,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,508 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 25 treesize of output 27 [2019-03-04 16:27:10,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,523 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:10,523 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,534 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,544 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,554 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,564 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,583 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,583 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:10,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,620 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:10,620 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,638 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:10,638 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:10,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,677 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:10,677 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,696 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:10,696 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:10,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,734 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:10,734 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,753 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:10,754 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:10,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,793 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:10,793 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,812 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:10,813 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:10,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,851 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:10,852 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,954 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:10,955 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:10,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:10,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-03-04 16:27:10,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:27:10,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:27:10,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:27:10,996 INFO L87 Difference]: Start difference. First operand 136 states and 629 transitions. Second operand 13 states. [2019-03-04 16:27:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:12,783 INFO L93 Difference]: Finished difference Result 199 states and 819 transitions. [2019-03-04 16:27:12,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:27:12,783 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-03-04 16:27:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:12,785 INFO L225 Difference]: With dead ends: 199 [2019-03-04 16:27:12,785 INFO L226 Difference]: Without dead ends: 194 [2019-03-04 16:27:12,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:27:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-03-04 16:27:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 142. [2019-03-04 16:27:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-03-04 16:27:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 663 transitions. [2019-03-04 16:27:13,557 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 663 transitions. Word has length 9 [2019-03-04 16:27:13,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:13,557 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 663 transitions. [2019-03-04 16:27:13,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:27:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 663 transitions. [2019-03-04 16:27:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:13,558 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:13,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:13,558 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:13,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:13,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1858585436, now seen corresponding path program 2 times [2019-03-04 16:27:13,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:13,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:13,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:13,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:13,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:27:13,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:13,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:13,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:13,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:13,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:13,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:27:13,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:13,800 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 18 treesize of output 21 [2019-03-04 16:27:13,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,804 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 21 treesize of output 23 [2019-03-04 16:27:13,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,811 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 23 treesize of output 25 [2019-03-04 16:27:13,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,821 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 25 treesize of output 27 [2019-03-04 16:27:13,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,835 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:13,836 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:13,846 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:13,856 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:13,866 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:13,876 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:13,895 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:13,895 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:13,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,931 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:13,932 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:13,952 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:13,952 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:13,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:13,990 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:13,990 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,009 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:14,010 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:14,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,049 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:14,049 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,069 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:14,069 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:14,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,108 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:14,108 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,128 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:14,128 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:27:14,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:14,165 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:14,165 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,185 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:14,185 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:14,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:14,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-03-04 16:27:14,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:27:14,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:27:14,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:27:14,229 INFO L87 Difference]: Start difference. First operand 142 states and 663 transitions. Second operand 13 states. [2019-03-04 16:27:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:15,865 INFO L93 Difference]: Finished difference Result 203 states and 839 transitions. [2019-03-04 16:27:15,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:27:15,865 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-03-04 16:27:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:15,866 INFO L225 Difference]: With dead ends: 203 [2019-03-04 16:27:15,867 INFO L226 Difference]: Without dead ends: 198 [2019-03-04 16:27:15,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:27:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-03-04 16:27:16,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 120. [2019-03-04 16:27:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-03-04 16:27:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 542 transitions. [2019-03-04 16:27:16,538 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 542 transitions. Word has length 9 [2019-03-04 16:27:16,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:16,538 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 542 transitions. [2019-03-04 16:27:16,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:27:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 542 transitions. [2019-03-04 16:27:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:16,538 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:16,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:16,539 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:16,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:16,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1629790556, now seen corresponding path program 3 times [2019-03-04 16:27:16,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:16,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:16,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:16,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:16,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:16,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:16,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:16,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:27:16,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:27:16,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:16,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:27:16,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:16,884 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 18 treesize of output 21 [2019-03-04 16:27:16,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,888 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 21 treesize of output 23 [2019-03-04 16:27:16,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,902 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 23 treesize of output 25 [2019-03-04 16:27:16,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,921 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 25 treesize of output 27 [2019-03-04 16:27:16,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,945 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:16,945 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,957 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,969 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,982 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,000 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,020 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,020 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:17,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,082 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:17,082 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,106 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:17,106 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:17,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,152 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:17,152 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,171 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:17,171 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:17,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,209 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:17,209 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,229 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:17,229 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:17,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,268 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:17,268 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,288 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:17,288 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:27:17,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,357 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:17,358 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,377 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:17,377 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:17,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:17,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:27:17,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:27:17,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:27:17,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:27:17,423 INFO L87 Difference]: Start difference. First operand 120 states and 542 transitions. Second operand 14 states. [2019-03-04 16:27:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:18,877 INFO L93 Difference]: Finished difference Result 145 states and 587 transitions. [2019-03-04 16:27:18,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:27:18,878 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-03-04 16:27:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:18,879 INFO L225 Difference]: With dead ends: 145 [2019-03-04 16:27:18,879 INFO L226 Difference]: Without dead ends: 130 [2019-03-04 16:27:18,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:27:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-03-04 16:27:19,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 73. [2019-03-04 16:27:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-03-04 16:27:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 316 transitions. [2019-03-04 16:27:19,319 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 316 transitions. Word has length 9 [2019-03-04 16:27:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:19,320 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 316 transitions. [2019-03-04 16:27:19,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:27:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 316 transitions. [2019-03-04 16:27:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:19,320 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:19,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:19,320 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1106663756, now seen corresponding path program 1 times [2019-03-04 16:27:19,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:19,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:19,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:19,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:19,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:19,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:19,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:19,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:19,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:27:19,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:19,499 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 18 treesize of output 21 [2019-03-04 16:27:19,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,505 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 21 treesize of output 23 [2019-03-04 16:27:19,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,514 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 23 treesize of output 25 [2019-03-04 16:27:19,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,528 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 25 treesize of output 27 [2019-03-04 16:27:19,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,542 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:19,542 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,552 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,561 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,571 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,581 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,600 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:19,600 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:19,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,632 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:19,633 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,652 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:19,652 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:19,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,685 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:19,685 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,705 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:19,705 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:19,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,738 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:19,738 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,758 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:19,758 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:19,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:19,791 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:19,792 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,811 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:19,812 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:19,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:19,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:27:19,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:27:19,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:27:19,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:19,853 INFO L87 Difference]: Start difference. First operand 73 states and 316 transitions. Second operand 12 states. [2019-03-04 16:27:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:20,962 INFO L93 Difference]: Finished difference Result 106 states and 406 transitions. [2019-03-04 16:27:20,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:27:20,962 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:27:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:20,963 INFO L225 Difference]: With dead ends: 106 [2019-03-04 16:27:20,963 INFO L226 Difference]: Without dead ends: 99 [2019-03-04 16:27:20,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:27:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-03-04 16:27:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 74. [2019-03-04 16:27:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-03-04 16:27:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 320 transitions. [2019-03-04 16:27:21,406 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 320 transitions. Word has length 9 [2019-03-04 16:27:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:21,406 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 320 transitions. [2019-03-04 16:27:21,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:27:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 320 transitions. [2019-03-04 16:27:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:21,406 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:21,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:21,406 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:21,407 INFO L82 PathProgramCache]: Analyzing trace with hash 770502112, now seen corresponding path program 1 times [2019-03-04 16:27:21,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:21,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:21,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:21,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:21,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:21,718 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-03-04 16:27:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:27:21,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:21,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:21,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:21,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:27:21,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:21,827 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 18 treesize of output 21 [2019-03-04 16:27:21,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,829 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 21 treesize of output 23 [2019-03-04 16:27:21,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,837 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 23 treesize of output 25 [2019-03-04 16:27:21,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,847 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 25 treesize of output 27 [2019-03-04 16:27:21,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,856 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,861 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:21,862 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,869 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,880 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,890 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,901 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,925 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,925 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:21,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,976 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:21,976 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,995 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:21,995 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:22,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,033 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:22,033 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,052 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:22,052 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:22,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,088 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:22,088 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,111 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:22,112 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:27:22,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:22,156 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:22,157 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:22,179 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:22,180 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:27:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:22,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:22,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:27:22,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:27:22,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:27:22,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:27:22,232 INFO L87 Difference]: Start difference. First operand 74 states and 320 transitions. Second operand 11 states. [2019-03-04 16:27:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:23,332 INFO L93 Difference]: Finished difference Result 96 states and 374 transitions. [2019-03-04 16:27:23,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:27:23,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:27:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:23,333 INFO L225 Difference]: With dead ends: 96 [2019-03-04 16:27:23,333 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:27:23,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:27:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:27:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2019-03-04 16:27:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-03-04 16:27:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 275 transitions. [2019-03-04 16:27:23,744 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 275 transitions. Word has length 9 [2019-03-04 16:27:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:23,744 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 275 transitions. [2019-03-04 16:27:23,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:27:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 275 transitions. [2019-03-04 16:27:23,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:23,745 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:23,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:23,745 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:23,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:23,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1003229404, now seen corresponding path program 1 times [2019-03-04 16:27:23,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:23,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:23,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:27:23,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:23,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:23,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:23,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:27:23,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:23,960 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 18 treesize of output 21 [2019-03-04 16:27:23,971 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 21 treesize of output 26 [2019-03-04 16:27:24,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,149 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:27:24,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,165 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:27:24,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,185 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:24,186 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:24,196 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:24,206 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:24,216 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:24,226 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:24,242 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:24,242 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:27:24,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,283 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:27:24,284 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:24,298 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:24,298 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:27:24,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,326 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:27:24,327 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:24,341 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:24,341 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:27:24,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,372 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:27:24,372 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:24,387 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:24,387 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:27:24,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:24,413 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:27:24,413 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:24,428 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:24,428 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:27:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:24,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:24,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:27:24,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:27:24,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:27:24,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:24,470 INFO L87 Difference]: Start difference. First operand 65 states and 275 transitions. Second operand 12 states. [2019-03-04 16:27:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:25,626 INFO L93 Difference]: Finished difference Result 103 states and 390 transitions. [2019-03-04 16:27:25,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:27:25,627 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:27:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:25,627 INFO L225 Difference]: With dead ends: 103 [2019-03-04 16:27:25,627 INFO L226 Difference]: Without dead ends: 96 [2019-03-04 16:27:25,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:27:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-03-04 16:27:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2019-03-04 16:27:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-03-04 16:27:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 336 transitions. [2019-03-04 16:27:26,153 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 336 transitions. Word has length 9 [2019-03-04 16:27:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:26,154 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 336 transitions. [2019-03-04 16:27:26,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:27:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 336 transitions. [2019-03-04 16:27:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:26,154 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:26,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:26,154 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:26,154 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-03-04 16:27:26,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:26,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:26,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:26,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:26,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:27:26,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:26,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:26,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:26,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:27:26,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:26,273 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 18 treesize of output 21 [2019-03-04 16:27:26,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,277 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 21 treesize of output 23 [2019-03-04 16:27:26,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,286 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 23 treesize of output 25 [2019-03-04 16:27:26,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,297 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 25 treesize of output 27 [2019-03-04 16:27:26,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,313 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:26,313 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:26,323 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:26,333 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:26,343 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:26,354 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:26,373 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:26,373 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:26,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,405 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:26,406 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:26,436 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:26,436 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:26,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,469 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:26,470 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:26,489 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:26,490 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:26,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:26,521 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:26,522 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:26,542 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:26,542 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:26,578 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:27:26,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:26,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4] total 6 [2019-03-04 16:27:26,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:26,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:26,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:26,596 INFO L87 Difference]: Start difference. First operand 77 states and 336 transitions. Second operand 8 states. [2019-03-04 16:27:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:27,629 INFO L93 Difference]: Finished difference Result 93 states and 382 transitions. [2019-03-04 16:27:27,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:27:27,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-03-04 16:27:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:27,630 INFO L225 Difference]: With dead ends: 93 [2019-03-04 16:27:27,630 INFO L226 Difference]: Without dead ends: 84 [2019-03-04 16:27:27,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:27:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-03-04 16:27:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2019-03-04 16:27:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-03-04 16:27:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 342 transitions. [2019-03-04 16:27:28,226 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 342 transitions. Word has length 9 [2019-03-04 16:27:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:28,226 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 342 transitions. [2019-03-04 16:27:28,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 342 transitions. [2019-03-04 16:27:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:28,226 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:28,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:28,226 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:28,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:28,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1745090498, now seen corresponding path program 1 times [2019-03-04 16:27:28,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:28,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:28,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:28,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:28,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:28,328 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:27:28,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:28,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:28,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:28,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:27:28,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:28,346 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 18 treesize of output 21 [2019-03-04 16:27:28,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,349 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 21 treesize of output 23 [2019-03-04 16:27:28,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,357 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 23 treesize of output 25 [2019-03-04 16:27:28,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,371 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 25 treesize of output 27 [2019-03-04 16:27:28,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,389 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:28,389 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,397 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,407 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,417 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,427 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,446 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:28,447 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:28,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,478 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:28,478 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,498 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:28,498 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:28,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:28,529 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,549 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:28,549 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:28,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:28,582 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:28,583 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:28,602 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:28,602 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:28,628 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:27:28,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:28,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:27:28,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:27:28,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:27:28,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:28,648 INFO L87 Difference]: Start difference. First operand 78 states and 342 transitions. Second operand 10 states. [2019-03-04 16:27:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:29,739 INFO L93 Difference]: Finished difference Result 94 states and 388 transitions. [2019-03-04 16:27:29,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:27:29,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:27:29,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:29,740 INFO L225 Difference]: With dead ends: 94 [2019-03-04 16:27:29,740 INFO L226 Difference]: Without dead ends: 85 [2019-03-04 16:27:29,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-03-04 16:27:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-03-04 16:27:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-03-04 16:27:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 361 transitions. [2019-03-04 16:27:30,365 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 361 transitions. Word has length 9 [2019-03-04 16:27:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:30,365 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 361 transitions. [2019-03-04 16:27:30,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:27:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 361 transitions. [2019-03-04 16:27:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:30,365 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:30,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:30,366 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:30,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:30,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1804915160, now seen corresponding path program 2 times [2019-03-04 16:27:30,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:30,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:30,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:30,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:30,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:30,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:30,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:30,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:30,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:30,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:30,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:27:30,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:30,525 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 18 treesize of output 21 [2019-03-04 16:27:30,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,533 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 21 treesize of output 23 [2019-03-04 16:27:30,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,540 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 23 treesize of output 25 [2019-03-04 16:27:30,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,555 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 25 treesize of output 27 [2019-03-04 16:27:30,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,579 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:30,579 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,588 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,598 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,608 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,618 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,637 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:30,638 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:30,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,674 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:30,675 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,696 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:30,697 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:30,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,733 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:30,733 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,753 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:30,753 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:30,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,789 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:30,790 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,809 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:30,810 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:30,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:30,842 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:30,842 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,861 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:30,862 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:30,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:30,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:27:30,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:27:30,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:27:30,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:27:30,904 INFO L87 Difference]: Start difference. First operand 82 states and 361 transitions. Second operand 11 states. [2019-03-04 16:27:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:32,312 INFO L93 Difference]: Finished difference Result 115 states and 463 transitions. [2019-03-04 16:27:32,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:27:32,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:27:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:32,313 INFO L225 Difference]: With dead ends: 115 [2019-03-04 16:27:32,313 INFO L226 Difference]: Without dead ends: 111 [2019-03-04 16:27:32,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:27:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-03-04 16:27:32,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2019-03-04 16:27:32,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-03-04 16:27:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 393 transitions. [2019-03-04 16:27:32,999 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 393 transitions. Word has length 9 [2019-03-04 16:27:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:32,999 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 393 transitions. [2019-03-04 16:27:32,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:27:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 393 transitions. [2019-03-04 16:27:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:33,000 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:33,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:33,000 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1810456286, now seen corresponding path program 1 times [2019-03-04 16:27:33,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:33,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:33,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:33,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:33,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:33,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:33,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:33,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:33,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:27:33,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:33,158 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 18 treesize of output 21 [2019-03-04 16:27:33,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,167 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 21 treesize of output 23 [2019-03-04 16:27:33,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,173 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 23 treesize of output 25 [2019-03-04 16:27:33,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,183 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 25 treesize of output 27 [2019-03-04 16:27:33,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,197 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:33,198 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:33,209 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:33,219 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:33,229 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:33,239 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:33,257 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:33,257 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:33,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,294 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:33,295 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:33,314 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:33,314 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:33,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,349 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:33,350 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:33,600 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:33,600 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:33,899 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-03-04 16:27:33,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:33,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,159 INFO L301 Elim1Store]: Index analysis took 230 ms [2019-03-04 16:27:34,160 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:34,160 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:34,369 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:34,370 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:34,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:34,406 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:34,406 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:34,424 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:34,424 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:34,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:34,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:27:34,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:27:34,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:27:34,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:27:34,467 INFO L87 Difference]: Start difference. First operand 88 states and 393 transitions. Second operand 11 states. [2019-03-04 16:27:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:35,852 INFO L93 Difference]: Finished difference Result 125 states and 495 transitions. [2019-03-04 16:27:35,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:27:35,852 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:27:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:35,853 INFO L225 Difference]: With dead ends: 125 [2019-03-04 16:27:35,853 INFO L226 Difference]: Without dead ends: 121 [2019-03-04 16:27:35,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:27:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-03-04 16:27:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 91. [2019-03-04 16:27:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-03-04 16:27:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 409 transitions. [2019-03-04 16:27:36,566 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 409 transitions. Word has length 9 [2019-03-04 16:27:36,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:36,566 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 409 transitions. [2019-03-04 16:27:36,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:27:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 409 transitions. [2019-03-04 16:27:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:36,567 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:36,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:36,567 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:36,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:36,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1915676112, now seen corresponding path program 1 times [2019-03-04 16:27:36,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:36,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:36,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:36,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:36,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:27:36,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:36,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:36,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:36,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:27:36,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:36,686 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 18 treesize of output 21 [2019-03-04 16:27:36,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,691 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 21 treesize of output 23 [2019-03-04 16:27:36,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,696 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 23 treesize of output 25 [2019-03-04 16:27:36,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,708 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 25 treesize of output 27 [2019-03-04 16:27:36,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,721 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:36,722 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,732 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,743 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,753 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,763 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,782 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:36,783 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:36,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,814 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:36,814 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,833 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:36,833 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:36,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,870 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:36,870 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,890 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:36,890 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:36,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:36,926 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:36,927 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,945 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:36,945 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:27:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:36,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:37,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4] total 6 [2019-03-04 16:27:37,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:37,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:37,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:37,000 INFO L87 Difference]: Start difference. First operand 91 states and 409 transitions. Second operand 8 states. [2019-03-04 16:27:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:38,146 INFO L93 Difference]: Finished difference Result 103 states and 433 transitions. [2019-03-04 16:27:38,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:27:38,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-03-04 16:27:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:38,147 INFO L225 Difference]: With dead ends: 103 [2019-03-04 16:27:38,147 INFO L226 Difference]: Without dead ends: 94 [2019-03-04 16:27:38,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:27:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-03-04 16:27:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-03-04 16:27:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-03-04 16:27:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 408 transitions. [2019-03-04 16:27:38,875 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 408 transitions. Word has length 9 [2019-03-04 16:27:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:38,875 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 408 transitions. [2019-03-04 16:27:38,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 408 transitions. [2019-03-04 16:27:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:38,876 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:38,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:38,876 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:38,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash -566829084, now seen corresponding path program 2 times [2019-03-04 16:27:38,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:38,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:38,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:38,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:38,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:39,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:39,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:39,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:39,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:39,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:39,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:27:39,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:39,067 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 18 treesize of output 21 [2019-03-04 16:27:39,076 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 21 treesize of output 26 [2019-03-04 16:27:39,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,091 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:27:39,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,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, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:27:39,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,127 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:39,127 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:39,137 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:39,146 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:39,156 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:39,166 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:39,185 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:39,186 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:27:39,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,228 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:27:39,228 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:39,243 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:39,243 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:27:39,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,274 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:27:39,274 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:39,287 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:39,288 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-03-04 16:27:39,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,317 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:27:39,317 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:39,332 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:39,332 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-03-04 16:27:39,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:39,362 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:27:39,362 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:39,377 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:39,377 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:27:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:39,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:39,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:27:39,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:27:39,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:27:39,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:39,420 INFO L87 Difference]: Start difference. First operand 91 states and 408 transitions. Second operand 12 states. [2019-03-04 16:27:40,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:40,772 INFO L93 Difference]: Finished difference Result 123 states and 492 transitions. [2019-03-04 16:27:40,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:27:40,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:27:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:40,773 INFO L225 Difference]: With dead ends: 123 [2019-03-04 16:27:40,773 INFO L226 Difference]: Without dead ends: 116 [2019-03-04 16:27:40,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:27:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-03-04 16:27:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 93. [2019-03-04 16:27:41,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-03-04 16:27:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 419 transitions. [2019-03-04 16:27:41,528 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 419 transitions. Word has length 9 [2019-03-04 16:27:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:41,529 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 419 transitions. [2019-03-04 16:27:41,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:27:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 419 transitions. [2019-03-04 16:27:41,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:41,529 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:41,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:41,529 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:41,529 INFO L82 PathProgramCache]: Analyzing trace with hash 113477018, now seen corresponding path program 2 times [2019-03-04 16:27:41,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:41,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:41,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:41,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:41,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:41,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:41,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:41,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:41,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:41,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:41,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:27:41,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:41,686 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 18 treesize of output 21 [2019-03-04 16:27:41,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,695 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 21 treesize of output 23 [2019-03-04 16:27:41,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,701 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 23 treesize of output 25 [2019-03-04 16:27:41,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,711 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 25 treesize of output 27 [2019-03-04 16:27:41,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,725 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:41,726 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:41,736 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:41,746 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:41,756 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:41,767 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:41,785 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:41,786 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:41,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,826 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:41,826 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:41,845 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:41,846 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:41,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,880 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:41,880 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:41,898 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:41,898 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:27:41,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,934 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:41,934 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:41,954 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:41,954 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:41,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:41,988 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:41,989 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:42,008 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:42,009 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:42,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:42,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:27:42,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:27:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:27:42,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:27:42,051 INFO L87 Difference]: Start difference. First operand 93 states and 419 transitions. Second operand 11 states. [2019-03-04 16:27:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:43,474 INFO L93 Difference]: Finished difference Result 121 states and 503 transitions. [2019-03-04 16:27:43,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:27:43,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:27:43,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:43,475 INFO L225 Difference]: With dead ends: 121 [2019-03-04 16:27:43,475 INFO L226 Difference]: Without dead ends: 114 [2019-03-04 16:27:43,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:27:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-03-04 16:27:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2019-03-04 16:27:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-03-04 16:27:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 430 transitions. [2019-03-04 16:27:44,252 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 430 transitions. Word has length 9 [2019-03-04 16:27:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:44,252 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 430 transitions. [2019-03-04 16:27:44,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:27:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 430 transitions. [2019-03-04 16:27:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:27:44,253 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:44,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:44,253 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:44,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash -687509706, now seen corresponding path program 1 times [2019-03-04 16:27:44,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:44,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:44,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:44,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:44,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:44,403 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:27:44,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:44,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:44,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:44,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:27:44,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:44,422 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 18 treesize of output 21 [2019-03-04 16:27:44,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:27:44,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:27:44,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,466 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:27:44,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,486 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:44,487 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:44,495 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:44,505 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:44,516 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:44,526 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:44,543 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:44,543 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:27:44,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,585 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:27:44,586 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:44,601 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:44,601 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:27:44,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,623 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:27:44,624 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:44,638 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:44,638 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:27:44,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:44,662 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:27:44,663 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:44,677 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:44,678 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:27:44,696 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:27:44,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:44,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:27:44,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:27:44,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:27:44,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:44,715 INFO L87 Difference]: Start difference. First operand 95 states and 430 transitions. Second operand 10 states. [2019-03-04 16:27:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:45,863 INFO L93 Difference]: Finished difference Result 111 states and 476 transitions. [2019-03-04 16:27:45,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:27:45,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:27:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:45,864 INFO L225 Difference]: With dead ends: 111 [2019-03-04 16:27:45,864 INFO L226 Difference]: Without dead ends: 102 [2019-03-04 16:27:45,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-03-04 16:27:46,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2019-03-04 16:27:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-03-04 16:27:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 429 transitions. [2019-03-04 16:27:46,629 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 429 transitions. Word has length 9 [2019-03-04 16:27:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:46,629 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 429 transitions. [2019-03-04 16:27:46,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:27:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 429 transitions. [2019-03-04 16:27:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:27:46,629 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:46,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:46,630 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:46,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:46,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1519970318, now seen corresponding path program 1 times [2019-03-04 16:27:46,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:46,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:46,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:46,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:46,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:46,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:46,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:46,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:46,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:27:46,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:46,856 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 18 treesize of output 21 [2019-03-04 16:27:46,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,861 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 21 treesize of output 23 [2019-03-04 16:27:46,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,867 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 23 treesize of output 25 [2019-03-04 16:27:46,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,877 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 25 treesize of output 27 [2019-03-04 16:27:46,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,892 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:46,892 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,903 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,913 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,923 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,933 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,951 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:46,951 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:46,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:46,984 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:46,985 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:47,004 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:47,004 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:47,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,037 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:47,037 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:47,057 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:47,057 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:27:47,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,088 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:47,089 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:47,108 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:47,109 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:27:47,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:47,145 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:47,145 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:47,165 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:47,165 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:47,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:47,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:27:47,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:27:47,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:27:47,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:47,213 INFO L87 Difference]: Start difference. First operand 95 states and 429 transitions. Second operand 12 states. [2019-03-04 16:27:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:48,521 INFO L93 Difference]: Finished difference Result 103 states and 453 transitions. [2019-03-04 16:27:48,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:27:48,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-03-04 16:27:48,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:48,523 INFO L225 Difference]: With dead ends: 103 [2019-03-04 16:27:48,523 INFO L226 Difference]: Without dead ends: 83 [2019-03-04 16:27:48,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:27:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-03-04 16:27:48,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 39. [2019-03-04 16:27:48,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 16:27:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 166 transitions. [2019-03-04 16:27:48,795 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 166 transitions. Word has length 10 [2019-03-04 16:27:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:48,795 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 166 transitions. [2019-03-04 16:27:48,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:27:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 166 transitions. [2019-03-04 16:27:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:27:48,795 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:48,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:48,795 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:48,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:48,795 INFO L82 PathProgramCache]: Analyzing trace with hash -905277736, now seen corresponding path program 1 times [2019-03-04 16:27:48,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:48,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:48,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:48,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:48,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:49,045 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2019-03-04 16:27:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:49,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:49,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:49,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:49,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:27:49,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:49,255 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 18 treesize of output 21 [2019-03-04 16:27:49,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,257 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 21 treesize of output 23 [2019-03-04 16:27:49,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,264 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 23 treesize of output 25 [2019-03-04 16:27:49,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,274 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 25 treesize of output 27 [2019-03-04 16:27:49,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,290 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:49,290 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,305 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,316 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,326 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,336 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,355 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,355 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:49,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,390 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:49,391 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,410 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:49,410 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:49,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,452 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:49,452 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,471 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:49,472 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:49,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,515 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:49,516 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,535 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:49,535 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:49,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,574 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:49,575 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,594 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:49,594 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:49,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:49,632 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:49,632 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:49,657 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:49,657 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:49,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:49,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:27:49,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:27:49,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:27:49,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:27:49,708 INFO L87 Difference]: Start difference. First operand 39 states and 166 transitions. Second operand 14 states. [2019-03-04 16:27:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:50,674 INFO L93 Difference]: Finished difference Result 54 states and 213 transitions. [2019-03-04 16:27:50,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:27:50,675 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-03-04 16:27:50,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:50,675 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:27:50,675 INFO L226 Difference]: Without dead ends: 47 [2019-03-04 16:27:50,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:27:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-03-04 16:27:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-03-04 16:27:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-03-04 16:27:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 151 transitions. [2019-03-04 16:27:50,921 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 151 transitions. Word has length 10 [2019-03-04 16:27:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:50,921 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 151 transitions. [2019-03-04 16:27:50,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:27:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 151 transitions. [2019-03-04 16:27:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:27:50,921 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:50,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:50,921 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:50,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:50,922 INFO L82 PathProgramCache]: Analyzing trace with hash 144914888, now seen corresponding path program 2 times [2019-03-04 16:27:50,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:50,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:50,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:50,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:50,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:51,244 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2019-03-04 16:27:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:27:51,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:51,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:51,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:51,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:51,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:51,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:27:51,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:51,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 18 treesize of output 21 [2019-03-04 16:27:51,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,432 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 21 treesize of output 23 [2019-03-04 16:27:51,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,437 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 23 treesize of output 25 [2019-03-04 16:27:51,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,447 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 25 treesize of output 27 [2019-03-04 16:27:51,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,462 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:51,462 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:51,473 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:51,482 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:51,492 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:51,502 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:51,521 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:51,522 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:51,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,556 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:51,557 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:51,574 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:51,574 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:51,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,616 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:51,616 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:51,634 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:51,634 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:51,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,672 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:51,672 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:51,691 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:51,692 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:51,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,731 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:51,731 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:51,751 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:51,751 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:51,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:51,792 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:51,792 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:51,812 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:51,812 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:51,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:51,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:27:51,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:27:51,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:27:51,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:27:51,860 INFO L87 Difference]: Start difference. First operand 36 states and 151 transitions. Second operand 14 states. [2019-03-04 16:27:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:52,943 INFO L93 Difference]: Finished difference Result 51 states and 198 transitions. [2019-03-04 16:27:52,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:27:52,943 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-03-04 16:27:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:52,944 INFO L225 Difference]: With dead ends: 51 [2019-03-04 16:27:52,944 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:27:52,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:27:52,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:27:53,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2019-03-04 16:27:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-03-04 16:27:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 123 transitions. [2019-03-04 16:27:53,172 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 123 transitions. Word has length 10 [2019-03-04 16:27:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:53,173 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 123 transitions. [2019-03-04 16:27:53,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:27:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 123 transitions. [2019-03-04 16:27:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:27:53,173 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:53,173 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:53,173 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:53,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:53,173 INFO L82 PathProgramCache]: Analyzing trace with hash -134479996, now seen corresponding path program 3 times [2019-03-04 16:27:53,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:53,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:53,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:53,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:53,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:27:53,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:53,360 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:53,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:27:53,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:27:53,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:53,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:27:53,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:53,382 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 18 treesize of output 21 [2019-03-04 16:27:53,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,392 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 21 treesize of output 23 [2019-03-04 16:27:53,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,400 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 23 treesize of output 25 [2019-03-04 16:27:53,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,410 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 25 treesize of output 27 [2019-03-04 16:27:53,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,425 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:53,425 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:53,436 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:53,446 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:53,456 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:53,466 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:53,485 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:53,486 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:53,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,522 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:53,523 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:53,538 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:53,539 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:53,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,575 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:53,576 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:53,594 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:53,594 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:53,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,630 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:53,630 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:53,646 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:53,646 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:53,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,680 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:53,680 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:53,698 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:53,698 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:53,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:53,733 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:53,734 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:53,752 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:53,752 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:53,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:53,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-03-04 16:27:53,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:27:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:27:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:27:53,798 INFO L87 Difference]: Start difference. First operand 30 states and 123 transitions. Second operand 13 states. [2019-03-04 16:27:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:54,791 INFO L93 Difference]: Finished difference Result 46 states and 175 transitions. [2019-03-04 16:27:54,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:27:54,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-03-04 16:27:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:54,792 INFO L225 Difference]: With dead ends: 46 [2019-03-04 16:27:54,792 INFO L226 Difference]: Without dead ends: 39 [2019-03-04 16:27:54,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:27:54,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-03-04 16:27:54,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-03-04 16:27:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-03-04 16:27:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 108 transitions. [2019-03-04 16:27:54,999 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 108 transitions. Word has length 10 [2019-03-04 16:27:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:54,999 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 108 transitions. [2019-03-04 16:27:54,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:27:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 108 transitions. [2019-03-04 16:27:54,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:27:54,999 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:54,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:54,999 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:54,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:55,000 INFO L82 PathProgramCache]: Analyzing trace with hash -127091828, now seen corresponding path program 3 times [2019-03-04 16:27:55,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:55,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:55,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:55,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:55,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:55,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:55,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:55,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:27:55,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:27:55,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:55,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:27:55,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:55,292 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 18 treesize of output 21 [2019-03-04 16:27:55,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,295 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 21 treesize of output 23 [2019-03-04 16:27:55,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,300 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 23 treesize of output 25 [2019-03-04 16:27:55,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,310 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 25 treesize of output 27 [2019-03-04 16:27:55,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,323 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:55,324 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:55,333 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:55,343 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:55,352 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:55,361 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:55,379 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:55,379 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:55,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,415 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:55,415 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:55,433 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:55,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:27:55,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,471 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:55,471 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:55,489 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:55,489 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:55,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,526 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:55,526 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:55,544 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:55,544 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:55,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,579 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:55,579 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:55,597 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:55,598 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:55,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:55,638 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:55,639 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:55,657 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:55,657 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:55,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:55,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:27:55,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:27:55,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:27:55,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:27:55,702 INFO L87 Difference]: Start difference. First operand 27 states and 108 transitions. Second operand 14 states. [2019-03-04 16:27:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:56,763 INFO L93 Difference]: Finished difference Result 57 states and 208 transitions. [2019-03-04 16:27:56,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:27:56,764 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-03-04 16:27:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:56,764 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:27:56,764 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:27:56,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:27:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:27:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-03-04 16:27:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:27:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 130 transitions. [2019-03-04 16:27:57,065 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 130 transitions. Word has length 10 [2019-03-04 16:27:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:57,066 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 130 transitions. [2019-03-04 16:27:57,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:27:57,066 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 130 transitions. [2019-03-04 16:27:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:27:57,066 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:57,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:57,066 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:57,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:57,066 INFO L82 PathProgramCache]: Analyzing trace with hash 230496124, now seen corresponding path program 4 times [2019-03-04 16:27:57,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:57,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:57,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:57,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:57,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:27:57,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:57,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:27:57,323 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:27:57,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:27:57,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:57,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:27:57,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:57,331 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 18 treesize of output 21 [2019-03-04 16:27:57,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,334 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 21 treesize of output 23 [2019-03-04 16:27:57,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,340 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 23 treesize of output 25 [2019-03-04 16:27:57,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:27:57,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,363 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:57,364 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:57,373 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:57,383 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:57,392 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:57,402 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:57,419 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:57,419 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:27:57,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,455 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:57,455 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:57,473 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:57,473 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:27:57,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,510 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:27:57,510 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:57,528 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:57,528 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-03-04 16:27:57,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,563 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:57,564 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:57,582 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:57,582 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:57,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,620 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:57,620 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:57,638 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:57,638 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:57,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:57,679 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:27:57,680 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:57,698 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:57,698 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:27:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:57,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:57,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-03-04 16:27:57,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:27:57,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:27:57,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:27:57,746 INFO L87 Difference]: Start difference. First operand 31 states and 130 transitions. Second operand 13 states. [2019-03-04 16:27:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:58,714 INFO L93 Difference]: Finished difference Result 39 states and 159 transitions. [2019-03-04 16:27:58,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:27:58,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-03-04 16:27:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:58,714 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:27:58,714 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:27:58,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:27:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:27:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:27:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:27:58,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:27:58,716 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-03-04 16:27:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:58,716 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:27:58,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:27:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:27:58,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:27:58,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:27:58,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:27:59,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:27:59,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:27:59,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:27:59,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:27:59,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:00,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:00,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:00,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:00,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:00,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:00,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:00,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:00,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:00,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:00,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:01,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:01,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:01,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:01,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:01,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:02,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:02,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:02,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:02,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:02,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:04,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:04,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:05,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:05,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:05,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:05,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:05,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:06,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:06,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:06,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:06,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:06,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:07,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:09,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:09,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:09,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:09,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:09,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:09,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:09,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:10,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:10,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:10,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:10,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:11,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:11,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:11,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:11,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:11,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:11,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:12,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:13,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:13,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:13,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:13,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:13,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:16,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:17,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:17,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:18,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:19,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:19,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:36,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:44,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:28:55,109 WARN L181 SmtUtils]: Spent 56.38 s on a formula simplification. DAG size of input: 3502 DAG size of output: 2524 [2019-03-04 16:30:22,216 WARN L181 SmtUtils]: Spent 1.45 m on a formula simplification. DAG size of input: 2339 DAG size of output: 157 [2019-03-04 16:30:22,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:30:22,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2019-03-04 16:30:22,220 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2019-03-04 16:30:22,221 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-03-04 16:30:22,221 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-03-04 16:30:22,221 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-03-04 16:30:22,221 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 49) no Hoare annotation was computed. [2019-03-04 16:30:22,221 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2019-03-04 16:30:22,221 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:30:22,221 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-03-04 16:30:22,221 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-03-04 16:30:22,221 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 54) no Hoare annotation was computed. [2019-03-04 16:30:22,222 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 34 46) the Hoare annotation is: (let ((.cse42 (select |#memory_int| ULTIMATE.start_main_p4))) (let ((.cse43 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse42 (- 1)))) (.cse32 (select |#memory_int| ULTIMATE.start_main_p5))) (let ((.cse30 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse22 (store |#memory_int| ULTIMATE.start_main_p5 (+ .cse32 1))) (.cse44 (select .cse43 ULTIMATE.start_main_p1))) (let ((.cse27 (<= 0 .cse32)) (.cse34 (<= 1 .cse44)) (.cse35 (<= (+ (select .cse22 ULTIMATE.start_main_p2) 1) 0)) (.cse16 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))) (.cse33 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse17 (- 1)))) (.cse41 (select .cse43 ULTIMATE.start_main_p3)) (.cse26 (select |#memory_int| ULTIMATE.start_main_p3)) (.cse3 (= (select .cse43 ULTIMATE.start_main_p2) 0)) (.cse12 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5))) (.cse4 (= .cse44 0)) (.cse40 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5))) (.cse0 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse37 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse14 (select .cse22 ULTIMATE.start_main_p4)) (.cse38 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse30 1)))) (let ((.cse6 (<= (+ (select .cse38 ULTIMATE.start_main_p4) 1) 0)) (.cse9 (= 0 .cse14)) (.cse18 (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (.cse19 (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (.cse11 (= 0 .cse32)) (.cse20 (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5)) (.cse21 (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (.cse25 (and (<= 0 .cse26) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) .cse3 .cse12 .cse4 .cse40 .cse0 .cse37))) (.cse23 (<= 1 .cse41)) (.cse2 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1))) (.cse5 (= .cse41 0)) (.cse1 (<= 1 (select .cse43 ULTIMATE.start_main_p5))) (.cse10 (select .cse33 ULTIMATE.start_main_p5)) (.cse15 (= (select .cse22 ULTIMATE.start_main_p3) 0)) (.cse28 (= .cse42 0)) (.cse29 (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4))) (.cse7 (<= 0 .cse41)) (.cse8 (let ((.cse39 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))) (or (and .cse12 .cse34 .cse0 (<= (+ (select .cse38 ULTIMATE.start_main_p2) 1) 0) .cse39) (and (and .cse12 .cse4 .cse40 .cse35 .cse0 .cse16) .cse39)))) (.cse24 (let ((.cse36 (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p5)))) (or (and .cse34 .cse35 .cse0 .cse36 .cse27) (and .cse3 .cse12 .cse0 .cse37 (or .cse34 (and (= .cse30 1) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= 1 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 2) 0))))) .cse36 .cse27)))) (.cse31 (<= (+ .cse14 1) 0))) (or (and .cse0 (and .cse1 (and (and (and (and .cse2 (and .cse3 .cse4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) .cse5) .cse6))) (and (and (and .cse7 .cse8) .cse9) (<= 0 .cse10)) (and (let ((.cse13 (= (select .cse22 ULTIMATE.start_main_p1) 0))) (or (and .cse11 .cse12 .cse0 (and (and .cse13 (<= (+ .cse14 2) 0)) .cse3 .cse2) .cse15 .cse16) (and .cse11 (<= .cse17 0) .cse18 .cse19 .cse13 .cse5 .cse20 .cse21))) .cse6) (and (or (and (and .cse23 .cse24) .cse9) (and .cse25 (<= 1 .cse26) .cse27 .cse28)) .cse29) (and .cse18 (= 0 .cse17) (= .cse26 0) .cse19 .cse11 (= .cse30 0) .cse20 .cse28 .cse21) (and (and (and .cse25 .cse23) .cse27) .cse31) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (or (and (and .cse4 (<= 1 .cse32) .cse3 .cse0 .cse2 .cse5 .cse16) .cse28) (or (and (and (<= 1 (select .cse33 ULTIMATE.start_main_p1)) .cse3 .cse0) .cse1 .cse15 .cse28) (and (and (and .cse0 (and .cse3 .cse34)) (= 0 .cse10)) .cse15 .cse28))) .cse29) (and .cse7 (or (and (and .cse8 .cse31) .cse27) (and .cse24 .cse31))))))))) [2019-03-04 16:30:22,253 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:30:22 BoogieIcfgContainer [2019-03-04 16:30:22,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:30:22,254 INFO L168 Benchmark]: Toolchain (without parser) took 375668.16 ms. Allocated memory was 134.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 108.4 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-03-04 16:30:22,254 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:30:22,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.35 ms. Allocated memory is still 134.2 MB. Free memory was 108.2 MB in the beginning and 105.9 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:30:22,255 INFO L168 Benchmark]: Boogie Preprocessor took 25.03 ms. Allocated memory is still 134.2 MB. Free memory was 105.9 MB in the beginning and 104.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:30:22,255 INFO L168 Benchmark]: RCFGBuilder took 403.22 ms. Allocated memory is still 134.2 MB. Free memory was 104.7 MB in the beginning and 93.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:30:22,255 INFO L168 Benchmark]: TraceAbstraction took 375176.56 ms. Allocated memory was 134.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 93.4 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-03-04 16:30:22,257 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.35 ms. Allocated memory is still 134.2 MB. Free memory was 108.2 MB in the beginning and 105.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.03 ms. Allocated memory is still 134.2 MB. Free memory was 105.9 MB in the beginning and 104.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 403.22 ms. Allocated memory is still 134.2 MB. Free memory was 104.7 MB in the beginning and 93.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 375176.56 ms. Allocated memory was 134.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 93.4 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((!(p3 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5] && (((!(p2 == p1) && #memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && #memory_int[p4 := #memory_int[p4] + -1][p1] == 0) && !(p1 == p3)) && #memory_int[p4 := #memory_int[p4] + -1][p3] == 0) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) || (((0 <= #memory_int[p4 := #memory_int[p4] + -1][p3] && (((((!(p2 == p5) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p3 == p2)) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && !(p1 == p4)) || ((((((!(p2 == p5) && #memory_int[p4 := #memory_int[p4] + -1][p1] == 0) && !(p1 == p5)) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && !(p3 == p2)) && !(p3 == p1)) && !(p1 == p4)))) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p5])) || (((((((0 == #memory_int[p5] && !(p2 == p5)) && !(p3 == p2)) && ((#memory_int[p5 := #memory_int[p5] + 1][p1] == 0 && #memory_int[p5 := #memory_int[p5] + 1][p4] + 2 <= 0) && #memory_int[p4 := #memory_int[p4] + -1][p2] == 0) && !(p2 == p1)) && #memory_int[p5 := #memory_int[p5] + 1][p3] == 0) && !(p3 == p1)) || (((((((0 == #memory_int[p5] && #memory_int[p2] <= 0) && p3 < p4) && p2 < p3) && #memory_int[p5 := #memory_int[p5] + 1][p1] == 0) && #memory_int[p4 := #memory_int[p4] + -1][p3] == 0) && p4 < p5) && p1 < p2)) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || ((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p3] && (((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && !(p3 == p2)) && !(p4 == p5)) && 0 <= #memory_int[p5]) || ((((((#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && !(p2 == p5)) && !(p3 == p2)) && !(p2 == p4)) && (1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] || (#memory_int[p1] == 1 && (exists ULTIMATE.start_main_p4 : int, ULTIMATE.start_main_p5 : int, ULTIMATE.start_main_p2 : int, ULTIMATE.start_main_p3 : int :: ((((((ULTIMATE.start_main_p3 < ULTIMATE.start_main_p4 && 0 == #memory_int[ULTIMATE.start_main_p2] + 1) && 1 == #memory_int[ULTIMATE.start_main_p5]) && #memory_int[ULTIMATE.start_main_p3] == 0) && ULTIMATE.start_main_p4 < ULTIMATE.start_main_p5) && ULTIMATE.start_main_p2 < ULTIMATE.start_main_p3) && p1 < ULTIMATE.start_main_p2) && #memory_int[ULTIMATE.start_main_p4] + 2 == 0)))) && !(p4 == p5)) && 0 <= #memory_int[p5]))) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) || ((((0 <= #memory_int[p3] && (((((!(p1 == p2) && #memory_int[p4 := #memory_int[p4] + -1][p2] == 0) && !(p2 == p5)) && #memory_int[p4 := #memory_int[p4] + -1][p1] == 0) && !(p1 == p5)) && !(p3 == p2)) && !(p2 == p4)) && 1 <= #memory_int[p3]) && 0 <= #memory_int[p5]) && #memory_int[p4] == 0)) && !(p5 == p4))) || ((((((((p3 < p4 && 0 == #memory_int[p2]) && #memory_int[p3] == 0) && p2 < p3) && 0 == #memory_int[p5]) && #memory_int[p1] == 0) && p4 < p5) && #memory_int[p4] == 0) && p1 < p2)) || ((((0 <= #memory_int[p3] && (((((!(p1 == p2) && #memory_int[p4 := #memory_int[p4] + -1][p2] == 0) && !(p2 == p5)) && #memory_int[p4 := #memory_int[p4] + -1][p1] == 0) && !(p1 == p5)) && !(p3 == p2)) && !(p2 == p4)) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && 0 <= #memory_int[p5]) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0)) || ((!(p3 == p4) && ((((((((#memory_int[p4 := #memory_int[p4] + -1][p1] == 0 && 1 <= #memory_int[p5]) && #memory_int[p4 := #memory_int[p4] + -1][p2] == 0) && !(p3 == p2)) && !(p2 == p1)) && #memory_int[p4 := #memory_int[p4] + -1][p3] == 0) && !(p3 == p1)) && #memory_int[p4] == 0) || (((((1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && #memory_int[p4 := #memory_int[p4] + -1][p2] == 0) && !(p3 == p2)) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && #memory_int[p5 := #memory_int[p5] + 1][p3] == 0) && #memory_int[p4] == 0) || ((((!(p3 == p2) && #memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p5]) && #memory_int[p5 := #memory_int[p5] + 1][p3] == 0) && #memory_int[p4] == 0))) && !(p5 == p4))) || (0 <= #memory_int[p4 := #memory_int[p4] + -1][p3] && ((((((((!(p2 == p5) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p3 == p2)) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && !(p1 == p4)) || ((((((!(p2 == p5) && #memory_int[p4 := #memory_int[p4] + -1][p1] == 0) && !(p1 == p5)) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && !(p3 == p2)) && !(p3 == p1)) && !(p1 == p4))) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0) && 0 <= #memory_int[p5]) || ((((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && !(p3 == p2)) && !(p4 == p5)) && 0 <= #memory_int[p5]) || ((((((#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && !(p2 == p5)) && !(p3 == p2)) && !(p2 == p4)) && (1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] || (#memory_int[p1] == 1 && (exists ULTIMATE.start_main_p4 : int, ULTIMATE.start_main_p5 : int, ULTIMATE.start_main_p2 : int, ULTIMATE.start_main_p3 : int :: ((((((ULTIMATE.start_main_p3 < ULTIMATE.start_main_p4 && 0 == #memory_int[ULTIMATE.start_main_p2] + 1) && 1 == #memory_int[ULTIMATE.start_main_p5]) && #memory_int[ULTIMATE.start_main_p3] == 0) && ULTIMATE.start_main_p4 < ULTIMATE.start_main_p5) && ULTIMATE.start_main_p2 < ULTIMATE.start_main_p3) && p1 < ULTIMATE.start_main_p2) && #memory_int[ULTIMATE.start_main_p4] + 2 == 0)))) && !(p4 == p5)) && 0 <= #memory_int[p5])) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. SAFE Result, 375.0s OverallTime, 152 OverallIterations, 2 TraceHistogramMax, 109.4s AutomataDifference, 0.0s DeadEndRemovalTime, 143.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 697 SDtfs, 3463 SDslu, 1 SDs, 0 SdLazy, 37360 SolverSat, 2050 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1959 GetRequests, 312 SyntacticMatches, 128 SemanticMatches, 1519 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3770 ImplicationChecksByTransitivity, 55.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 30.1s AutomataMinimizationTime, 152 MinimizatonAttempts, 4921 StatesRemovedByMinimization, 150 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 52 NumberOfFragments, 1161 HoareAnnotationTreeSize, 1 FomulaSimplifications, 6542501072511223 FormulaSimplificationTreeSizeReduction, 56.3s HoareSimplificationTime, 1 FomulaSimplificationsInter, 143516698549 FormulaSimplificationTreeSizeReductionInter, 87.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 85.4s InterpolantComputationTime, 2007 NumberOfCodeBlocks, 2007 NumberOfCodeBlocksAsserted, 347 NumberOfCheckSat, 1706 ConstructedInterpolants, 805 QuantifiedInterpolants, 277361 SizeOfPredicates, 596 NumberOfNonLiveVariables, 3979 ConjunctsInSsa, 1265 ConjunctsInUnsatCore, 301 InterpolantComputations, 3 PerfectInterpolantSequences, 91/1962 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...