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-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:24:17,422 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:24:17,424 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:24:17,440 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:24:17,441 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:24:17,442 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:24:17,443 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:24:17,445 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:24:17,447 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:24:17,448 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:24:17,448 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:24:17,449 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:24:17,450 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:24:17,450 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:24:17,451 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:24:17,452 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:24:17,453 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:24:17,455 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:24:17,457 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:24:17,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:24:17,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:24:17,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:24:17,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:24:17,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:24:17,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:24:17,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:24:17,468 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:24:17,468 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:24:17,469 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:24:17,470 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:24:17,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:24:17,471 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:24:17,472 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:24:17,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:24:17,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:24:17,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:24:17,474 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:17,486 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:24:17,486 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:24:17,487 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:24:17,487 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:24:17,487 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:24:17,488 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:24:17,488 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:24:17,488 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:24:17,488 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:24:17,488 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:24:17,488 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:24:17,489 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:24:17,489 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:24:17,489 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:24:17,489 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:24:17,490 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:24:17,490 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:24:17,490 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:24:17,490 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:24:17,491 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:24:17,491 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:24:17,491 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:24:17,491 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:24:17,491 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:24:17,491 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:24:17,492 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:24:17,492 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:24:17,492 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:24:17,492 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:24:17,492 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:24:17,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:24:17,493 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:24:17,493 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:24:17,493 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:24:17,493 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:24:17,494 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:24:17,494 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:24:17,494 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:24:17,494 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:24:17,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:24:17,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:24:17,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:24:17,539 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:24:17,539 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:24:17,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-unlimited.bpl [2019-03-04 16:24:17,540 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-03-04 16:24:17,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:24:17,574 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:24:17,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:24:17,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:24:17,575 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:24:17,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:17" (1/1) ... [2019-03-04 16:24:17,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:17" (1/1) ... [2019-03-04 16:24:17,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:24:17,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:24:17,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:24:17,627 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:24:17,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:17" (1/1) ... [2019-03-04 16:24:17,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:17" (1/1) ... [2019-03-04 16:24:17,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:17" (1/1) ... [2019-03-04 16:24:17,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:17" (1/1) ... [2019-03-04 16:24:17,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:17" (1/1) ... [2019-03-04 16:24:17,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:17" (1/1) ... [2019-03-04 16:24:17,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:17" (1/1) ... [2019-03-04 16:24:17,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:24:17,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:24:17,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:24:17,650 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:24:17,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:17" (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:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:24:17,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:24:18,021 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:24:18,021 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-03-04 16:24:18,023 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:24:18 BoogieIcfgContainer [2019-03-04 16:24:18,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:24:18,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:24:18,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:24:18,034 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:24:18,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:24:17" (1/2) ... [2019-03-04 16:24:18,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@995137c and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:24:18, skipping insertion in model container [2019-03-04 16:24:18,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:24:18" (2/2) ... [2019-03-04 16:24:18,038 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-03-04 16:24:18,049 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:24:18,058 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-03-04 16:24:18,076 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-03-04 16:24:18,111 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:24:18,111 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:24:18,112 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:24:18,112 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:24:18,112 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:24:18,112 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:24:18,112 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:24:18,113 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:24:18,113 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:24:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-03-04 16:24:18,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:24:18,141 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:18,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:24:18,144 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:18,150 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-03-04 16:24:18,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:18,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:18,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:18,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:18,328 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,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:24:18,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:24:18,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:24:18,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:24:18,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:24:18,347 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-03-04 16:24:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:18,516 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-03-04 16:24:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:24:18,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:24:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:18,533 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:24:18,533 INFO L226 Difference]: Without dead ends: 20 [2019-03-04 16:24:18,536 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,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-03-04 16:24:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-03-04 16:24:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:24:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-03-04 16:24:18,572 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-03-04 16:24:18,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:18,574 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-03-04 16:24:18,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:24:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-03-04 16:24:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:18,575 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:18,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:18,576 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:18,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:18,576 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-03-04 16:24:18,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:18,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:18,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:18,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:18,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:18,738 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:18,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:18,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:18,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:18,956 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:18,958 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,063 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,193 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,276 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:24:19,358 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:24:19,385 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:19,416 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:19,647 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:19,649 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,753 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,784 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,805 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,835 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:19,889 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:19,889 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:24:20,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:20,001 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,035 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,036 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:35 [2019-03-04 16:24:20,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:20,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:20,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:20,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:20,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:20,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:20,140 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-03-04 16:24:20,418 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-03-04 16:24:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:20,751 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-03-04 16:24:20,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:20,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:20,756 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:24:20,756 INFO L226 Difference]: Without dead ends: 37 [2019-03-04 16:24:20,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-03-04 16:24:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-03-04 16:24:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:24:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-03-04 16:24:20,763 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-03-04 16:24:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:20,764 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-03-04 16:24:20,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-03-04 16:24:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:20,764 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:20,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:20,766 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:20,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:20,766 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-03-04 16:24:20,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:20,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:20,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:20,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:20,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:20,841 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,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:20,842 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:20,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:20,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:20,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:20,912 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:20,913 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:20,916 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,926 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,938 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,976 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:24:20,982 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:24:20,992 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:21,001 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:21,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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:21,051 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,063 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,076 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,097 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,131 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:21,160 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:21,161 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:24:23,310 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 59 [2019-03-04 16:24:23,318 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:24:23,540 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-03-04 16:24:23,540 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:231 [2019-03-04 16:24:25,915 WARN L181 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 132 DAG size of output: 56 [2019-03-04 16:24:25,917 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:25,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:25,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:25,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:25,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:25,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=16, Unknown=1, NotChecked=0, Total=30 [2019-03-04 16:24:25,937 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 6 states. [2019-03-04 16:24:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:26,125 INFO L93 Difference]: Finished difference Result 31 states and 54 transitions. [2019-03-04 16:24:26,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:26,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:26,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:26,128 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:24:26,128 INFO L226 Difference]: Without dead ends: 27 [2019-03-04 16:24:26,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=13, Invalid=16, Unknown=1, NotChecked=0, Total=30 [2019-03-04 16:24:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-03-04 16:24:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2019-03-04 16:24:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:24:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 36 transitions. [2019-03-04 16:24:26,134 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 36 transitions. Word has length 3 [2019-03-04 16:24:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:26,135 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 36 transitions. [2019-03-04 16:24:26,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 36 transitions. [2019-03-04 16:24:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:26,135 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:26,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:26,136 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:26,136 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-03-04 16:24:26,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:26,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:26,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:26,167 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:26,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:24:26,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:24:26,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:24:26,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:24:26,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:24:26,169 INFO L87 Difference]: Start difference. First operand 16 states and 36 transitions. Second operand 3 states. [2019-03-04 16:24:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:26,213 INFO L93 Difference]: Finished difference Result 18 states and 36 transitions. [2019-03-04 16:24:26,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:24:26,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:24:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:26,214 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:24:26,215 INFO L226 Difference]: Without dead ends: 17 [2019-03-04 16:24:26,215 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:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-03-04 16:24:26,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-03-04 16:24:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:24:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2019-03-04 16:24:26,221 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 35 transitions. Word has length 3 [2019-03-04 16:24:26,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:26,221 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 35 transitions. [2019-03-04 16:24:26,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:24:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 35 transitions. [2019-03-04 16:24:26,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:26,222 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:26,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:26,222 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:26,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:26,222 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-03-04 16:24:26,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:26,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:26,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:26,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:26,285 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,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:26,285 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:26,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:26,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:26,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:26,421 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:26,422 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,447 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,460 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,475 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,496 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:24:26,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:24:26,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:26,517 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,556 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:26,557 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,566 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,581 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,591 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,605 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,651 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:26,652 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:24:26,720 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:26,721 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:26,743 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,744 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:35 [2019-03-04 16:24:26,768 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,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:26,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:26,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:26,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:26,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:26,790 INFO L87 Difference]: Start difference. First operand 16 states and 35 transitions. Second operand 6 states. [2019-03-04 16:24:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:27,009 INFO L93 Difference]: Finished difference Result 36 states and 63 transitions. [2019-03-04 16:24:27,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:27,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:27,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:27,013 INFO L225 Difference]: With dead ends: 36 [2019-03-04 16:24:27,013 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:24:27,014 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:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:24:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2019-03-04 16:24:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:24:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-03-04 16:24:27,019 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 3 [2019-03-04 16:24:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:27,019 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-03-04 16:24:27,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-03-04 16:24:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:27,020 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:27,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:27,020 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:27,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:27,020 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-03-04 16:24:27,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:27,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:27,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:27,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:27,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:27,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:27,093 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:27,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:27,110 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:24:27,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:27,123 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,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,131 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,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,234 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,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,394 INFO L301 Elim1Store]: Index analysis took 132 ms [2019-03-04 16:24:27,395 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,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:27,550 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:27,551 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,559 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,571 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,580 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,592 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,666 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:27,667 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,672 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,679 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,690 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:27,712 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:27,712 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:24:27,790 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:24:27,792 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:24:27,846 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:24:27,847 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:76 [2019-03-04 16:24:28,095 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 69 [2019-03-04 16:24:28,099 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-03-04 16:24:28,370 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:24:28,372 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:28,482 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-03-04 16:24:28,482 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-03-04 16:24:28,614 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,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:28,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:28,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:28,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:28,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:28,634 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-03-04 16:24:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:37,667 INFO L93 Difference]: Finished difference Result 56 states and 102 transitions. [2019-03-04 16:24:37,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:37,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:37,670 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:24:37,670 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:24:37,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:24:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:24:37,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-03-04 16:24:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-03-04 16:24:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-03-04 16:24:37,683 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-03-04 16:24:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:37,683 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-03-04 16:24:37,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-03-04 16:24:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:37,684 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:37,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:37,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:37,686 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-03-04 16:24:37,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:37,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:37,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:37,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:37,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:37,748 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:37,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:37,749 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:37,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:37,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:24:37,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:37,773 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,792 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:37,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:37,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,822 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:24:37,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:37,867 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:37,868 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,878 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,889 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,900 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,911 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,938 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:24:37,938 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,944 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,953 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:37,972 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:37,972 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-03-04 16:24:38,003 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:24:38,003 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,019 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,020 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:31 [2019-03-04 16:24:38,033 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:38,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:38,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:38,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:38,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:38,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:38,063 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 6 states. [2019-03-04 16:24:38,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:38,270 INFO L93 Difference]: Finished difference Result 37 states and 79 transitions. [2019-03-04 16:24:38,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:38,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:38,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:38,272 INFO L225 Difference]: With dead ends: 37 [2019-03-04 16:24:38,272 INFO L226 Difference]: Without dead ends: 36 [2019-03-04 16:24:38,272 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:38,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-03-04 16:24:38,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2019-03-04 16:24:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-03-04 16:24:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 66 transitions. [2019-03-04 16:24:38,279 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 66 transitions. Word has length 4 [2019-03-04 16:24:38,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:38,279 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 66 transitions. [2019-03-04 16:24:38,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 66 transitions. [2019-03-04 16:24:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:38,280 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:38,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:38,280 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:38,280 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-03-04 16:24:38,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:38,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:38,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:38,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:38,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:24:38,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:38,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 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:38,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:38,423 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:24:38,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:38,485 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:38,485 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,496 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,506 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,518 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,540 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:24:38,546 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:24:38,549 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:38,552 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,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, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:38,632 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,641 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,650 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,661 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,671 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,693 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:38,694 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:24:38,735 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:38,736 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,754 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,754 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:24:38,801 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 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:24:38,802 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:38,819 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,819 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-03-04 16:24:38,838 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,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:38,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:38,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:38,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:38,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:38,860 INFO L87 Difference]: Start difference. First operand 22 states and 66 transitions. Second operand 8 states. [2019-03-04 16:24:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:39,426 INFO L93 Difference]: Finished difference Result 56 states and 111 transitions. [2019-03-04 16:24:39,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:39,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:39,428 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:24:39,428 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:24:39,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:24:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 22. [2019-03-04 16:24:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-03-04 16:24:39,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 66 transitions. [2019-03-04 16:24:39,437 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 66 transitions. Word has length 4 [2019-03-04 16:24:39,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:39,437 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 66 transitions. [2019-03-04 16:24:39,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 66 transitions. [2019-03-04 16:24:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:39,438 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:39,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:39,438 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:39,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:39,439 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-03-04 16:24:39,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:39,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:39,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:39,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:39,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:39,506 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:39,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:39,507 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:39,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:39,520 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:24:39,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:39,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:24:39,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,585 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,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,685 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,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,861 INFO L301 Elim1Store]: Index analysis took 149 ms [2019-03-04 16:24:39,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:39,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:39,956 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:39,957 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:39,968 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,980 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,000 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,041 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,079 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:40,079 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,082 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,091 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,101 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,124 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:40,124 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:24:40,164 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,165 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,189 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:40,190 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:24:40,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, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:24:40,225 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,239 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,240 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:24:40,257 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,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:40,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:40,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:40,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:40,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:40,280 INFO L87 Difference]: Start difference. First operand 22 states and 66 transitions. Second operand 8 states. [2019-03-04 16:24:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:40,612 INFO L93 Difference]: Finished difference Result 49 states and 106 transitions. [2019-03-04 16:24:40,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:40,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:40,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:40,614 INFO L225 Difference]: With dead ends: 49 [2019-03-04 16:24:40,614 INFO L226 Difference]: Without dead ends: 45 [2019-03-04 16:24:40,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 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:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-03-04 16:24:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2019-03-04 16:24:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-03-04 16:24:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 77 transitions. [2019-03-04 16:24:40,623 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 77 transitions. Word has length 4 [2019-03-04 16:24:40,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:40,624 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 77 transitions. [2019-03-04 16:24:40,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 77 transitions. [2019-03-04 16:24:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:40,625 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:40,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:40,625 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:40,625 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-03-04 16:24:40,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:40,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:40,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:40,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:40,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:40,685 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:40,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:40,686 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:40,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:40,709 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:24:40,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:40,718 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,737 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,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,753 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:40,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,764 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:24:40,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:40,787 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:40,788 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,803 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,814 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,824 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,835 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,874 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:40,875 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,887 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,895 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,911 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,940 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:40,941 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:24:40,965 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:40,965 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:40,992 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:40,992 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-03-04 16:24:41,006 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:41,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:41,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:41,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:41,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:41,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:41,027 INFO L87 Difference]: Start difference. First operand 24 states and 77 transitions. Second operand 6 states. [2019-03-04 16:24:41,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:41,203 INFO L93 Difference]: Finished difference Result 40 states and 97 transitions. [2019-03-04 16:24:41,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:41,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:41,204 INFO L225 Difference]: With dead ends: 40 [2019-03-04 16:24:41,204 INFO L226 Difference]: Without dead ends: 39 [2019-03-04 16:24:41,205 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:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-03-04 16:24:41,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2019-03-04 16:24:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-03-04 16:24:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 77 transitions. [2019-03-04 16:24:41,212 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 77 transitions. Word has length 4 [2019-03-04 16:24:41,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:41,212 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 77 transitions. [2019-03-04 16:24:41,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:41,213 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 77 transitions. [2019-03-04 16:24:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:41,213 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:41,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:41,213 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:41,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:41,214 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-03-04 16:24:41,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:41,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:41,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:41,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:41,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:41,301 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:41,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:41,301 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:41,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:41,317 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:24:41,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:41,323 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,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,330 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,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,338 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,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,356 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,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:41,380 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,381 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,391 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,403 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,413 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,425 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,470 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:41,471 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,498 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,505 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,516 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,535 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,565 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:41,566 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:24:41,628 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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,629 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,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:24:41,670 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:24:41,707 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:24:41,708 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:41,728 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,728 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:40 [2019-03-04 16:24:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:41,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:41,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:41,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:41,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:41,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:41,768 INFO L87 Difference]: Start difference. First operand 24 states and 77 transitions. Second operand 8 states. [2019-03-04 16:24:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:42,058 INFO L93 Difference]: Finished difference Result 52 states and 118 transitions. [2019-03-04 16:24:42,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:42,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:42,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:42,060 INFO L225 Difference]: With dead ends: 52 [2019-03-04 16:24:42,060 INFO L226 Difference]: Without dead ends: 51 [2019-03-04 16:24:42,061 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:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-03-04 16:24:42,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 24. [2019-03-04 16:24:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-03-04 16:24:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 77 transitions. [2019-03-04 16:24:42,070 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 77 transitions. Word has length 4 [2019-03-04 16:24:42,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:42,070 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 77 transitions. [2019-03-04 16:24:42,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 77 transitions. [2019-03-04 16:24:42,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:42,071 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:42,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:42,071 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:42,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:42,072 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-03-04 16:24:42,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:42,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:42,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:42,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:42,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:42,177 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,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:42,178 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:42,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:42,193 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:24:42,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:42,209 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:42,210 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,216 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,224 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,237 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,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:24:42,259 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:24:42,265 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:42,270 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:42,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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:42,309 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,318 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,337 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,345 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,355 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,377 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:42,378 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:24:42,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 31 treesize of output 26 [2019-03-04 16:24:42,413 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,432 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,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:24:42,477 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 5 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:24:42,478 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:42,500 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:42,501 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-03-04 16:24:42,526 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,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:42,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:42,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:42,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:42,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:42,546 INFO L87 Difference]: Start difference. First operand 24 states and 77 transitions. Second operand 8 states. [2019-03-04 16:24:42,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:42,907 INFO L93 Difference]: Finished difference Result 61 states and 152 transitions. [2019-03-04 16:24:42,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:42,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:42,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:42,908 INFO L225 Difference]: With dead ends: 61 [2019-03-04 16:24:42,908 INFO L226 Difference]: Without dead ends: 59 [2019-03-04 16:24:42,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-03-04 16:24:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 30. [2019-03-04 16:24:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-03-04 16:24:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2019-03-04 16:24:42,919 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 4 [2019-03-04 16:24:42,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:42,919 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2019-03-04 16:24:42,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2019-03-04 16:24:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:42,920 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:42,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:42,920 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:42,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:42,921 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-03-04 16:24:42,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:42,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:42,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:42,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:42,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:42,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:24:42,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:24:42,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:24:42,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:24:42,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:24:42,953 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 4 states. [2019-03-04 16:24:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:43,011 INFO L93 Difference]: Finished difference Result 39 states and 113 transitions. [2019-03-04 16:24:43,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:24:43,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:24:43,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:43,012 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:24:43,013 INFO L226 Difference]: Without dead ends: 38 [2019-03-04 16:24:43,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:24:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-03-04 16:24:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-03-04 16:24:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:24:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-03-04 16:24:43,035 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-03-04 16:24:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:43,035 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-03-04 16:24:43,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:24:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-03-04 16:24:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:43,040 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:43,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:43,040 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:43,041 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-03-04 16:24:43,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:43,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:43,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:43,436 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,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:43,437 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:43,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:43,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:43,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:43,498 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:24:43,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:43,534 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,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,586 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,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,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, 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,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,739 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,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:43,752 INFO L188 IndexEqualityManager]: detected not equals via solver [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,756 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,756 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,768 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,780 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,791 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,803 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,895 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:43,895 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,901 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,912 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,926 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,961 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:43,993 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:43,993 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:24:44,022 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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:44,022 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,053 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:44,054 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:24:44,197 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:24:44,198 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,219 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:44,219 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:46 [2019-03-04 16:24:44,235 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:44,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:44,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:44,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:44,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:44,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:44,255 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 8 states. [2019-03-04 16:24:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:44,623 INFO L93 Difference]: Finished difference Result 61 states and 153 transitions. [2019-03-04 16:24:44,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:44,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:44,624 INFO L225 Difference]: With dead ends: 61 [2019-03-04 16:24:44,624 INFO L226 Difference]: Without dead ends: 59 [2019-03-04 16:24:44,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-03-04 16:24:44,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2019-03-04 16:24:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-03-04 16:24:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2019-03-04 16:24:44,638 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 119 transitions. Word has length 4 [2019-03-04 16:24:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:44,638 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 119 transitions. [2019-03-04 16:24:44,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 119 transitions. [2019-03-04 16:24:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:44,639 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:44,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:44,639 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:44,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:44,639 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-03-04 16:24:44,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:44,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:44,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:44,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:44,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:44,721 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:44,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:44,721 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:44,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:44,735 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:24:44,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:44,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:24:44,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,811 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:44,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,819 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:44,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,835 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:44,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:44,876 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:44,877 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,886 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,896 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,906 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,918 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,951 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:44,951 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,955 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,960 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,971 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:44,993 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:44,993 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:24:45,023 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:45,024 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,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:45,040 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:35 [2019-03-04 16:24:45,066 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 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:24:45,067 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,085 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,086 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:24:45,098 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:45,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:45,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:45,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:45,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:45,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:45,121 INFO L87 Difference]: Start difference. First operand 34 states and 119 transitions. Second operand 8 states. [2019-03-04 16:24:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:45,450 INFO L93 Difference]: Finished difference Result 63 states and 175 transitions. [2019-03-04 16:24:45,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:45,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:45,451 INFO L225 Difference]: With dead ends: 63 [2019-03-04 16:24:45,451 INFO L226 Difference]: Without dead ends: 62 [2019-03-04 16:24:45,452 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:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-03-04 16:24:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 37. [2019-03-04 16:24:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:24:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-03-04 16:24:45,464 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 4 [2019-03-04 16:24:45,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:45,465 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-03-04 16:24:45,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:45,465 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-03-04 16:24:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:45,465 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:45,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:45,466 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:45,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:45,466 INFO L82 PathProgramCache]: Analyzing trace with hash 933900, now seen corresponding path program 1 times [2019-03-04 16:24:45,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:45,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:45,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:45,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:45,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:45,519 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,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:45,519 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:45,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:45,542 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:24:45,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:45,580 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,606 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:45,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,617 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:45,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,628 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:24:45,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:45,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:45,651 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,660 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,672 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,682 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,693 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,732 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:45,733 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,739 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,753 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,776 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:45,808 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:45,809 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:61, output treesize:62 [2019-03-04 16:24:45,841 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:24:45,842 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:24:45,899 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:24:45,900 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:100 [2019-03-04 16:24:45,941 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,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:45,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:45,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:45,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:45,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:45,967 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 6 states. [2019-03-04 16:24:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:46,234 INFO L93 Difference]: Finished difference Result 50 states and 169 transitions. [2019-03-04 16:24:46,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:46,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:46,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:46,236 INFO L225 Difference]: With dead ends: 50 [2019-03-04 16:24:46,236 INFO L226 Difference]: Without dead ends: 49 [2019-03-04 16:24:46,236 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:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-03-04 16:24:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2019-03-04 16:24:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:24:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 160 transitions. [2019-03-04 16:24:46,251 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 160 transitions. Word has length 4 [2019-03-04 16:24:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:46,251 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 160 transitions. [2019-03-04 16:24:46,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 160 transitions. [2019-03-04 16:24:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:46,252 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:46,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:46,253 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:46,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:46,253 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-03-04 16:24:46,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:46,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:46,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:46,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:46,394 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:46,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:46,394 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:46,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:46,410 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:24:46,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:46,416 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,440 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:46,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,462 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:46,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:24:46,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:46,511 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:46,512 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,521 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,532 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,542 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,554 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,590 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:46,590 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,595 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,604 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,621 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,649 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:46,650 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:24:46,699 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:46,700 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:46,726 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,727 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-03-04 16:24:46,740 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:46,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:46,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:46,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:46,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:46,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:46,761 INFO L87 Difference]: Start difference. First operand 40 states and 160 transitions. Second operand 6 states. [2019-03-04 16:24:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:46,911 INFO L93 Difference]: Finished difference Result 57 states and 186 transitions. [2019-03-04 16:24:46,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:46,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:24:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:46,913 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:24:46,913 INFO L226 Difference]: Without dead ends: 56 [2019-03-04 16:24:46,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:46,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-03-04 16:24:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2019-03-04 16:24:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:24:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 166 transitions. [2019-03-04 16:24:46,927 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 166 transitions. Word has length 4 [2019-03-04 16:24:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:46,927 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 166 transitions. [2019-03-04 16:24:46,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 166 transitions. [2019-03-04 16:24:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:46,928 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:46,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:46,928 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:46,928 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-03-04 16:24:46,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:46,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:46,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:46,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:46,992 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,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:46,992 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:47,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:47,006 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:24:47,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:47,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:47,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,019 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,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,042 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,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,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:24:47,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:47,089 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,090 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,100 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,110 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,120 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,141 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,222 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:47,223 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,292 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,459 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,627 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,646 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,675 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:47,675 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:24:47,717 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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,717 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,746 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,747 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:24:47,861 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:24:47,862 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:47,883 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,884 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:40 [2019-03-04 16:24:47,943 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,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:47,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:47,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:47,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:47,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:47,963 INFO L87 Difference]: Start difference. First operand 41 states and 166 transitions. Second operand 8 states. [2019-03-04 16:24:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:48,350 INFO L93 Difference]: Finished difference Result 75 states and 230 transitions. [2019-03-04 16:24:48,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:48,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:48,353 INFO L225 Difference]: With dead ends: 75 [2019-03-04 16:24:48,353 INFO L226 Difference]: Without dead ends: 74 [2019-03-04 16:24:48,353 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:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-03-04 16:24:48,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 45. [2019-03-04 16:24:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-03-04 16:24:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 190 transitions. [2019-03-04 16:24:48,371 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 190 transitions. Word has length 4 [2019-03-04 16:24:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:48,372 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 190 transitions. [2019-03-04 16:24:48,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 190 transitions. [2019-03-04 16:24:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:48,373 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:48,373 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-03-04 16:24:48,373 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:48,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:48,374 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-03-04 16:24:48,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:48,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:48,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:48,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:48,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:48,445 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:48,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:48,446 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:48,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:48,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:48,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:48,471 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:24:48,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:48,488 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,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,496 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:48,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,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:48,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,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, 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:48,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:48,556 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:48,556 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,567 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,578 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,588 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,598 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,651 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:48,652 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,654 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,662 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,707 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,726 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,757 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:48,758 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-03-04 16:24:48,805 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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:48,805 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:48,916 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,916 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:52 [2019-03-04 16:24:49,581 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 38 treesize of output 45 [2019-03-04 16:24:49,582 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:49,870 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,871 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:52 [2019-03-04 16:24:50,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, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:24:50,146 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:50,168 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,168 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-03-04 16:24:50,186 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:50,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:50,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:24:50,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:24:50,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:24:50,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:50,206 INFO L87 Difference]: Start difference. First operand 45 states and 190 transitions. Second operand 9 states. [2019-03-04 16:24:50,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:50,880 INFO L93 Difference]: Finished difference Result 79 states and 256 transitions. [2019-03-04 16:24:50,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:50,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-03-04 16:24:50,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:50,882 INFO L225 Difference]: With dead ends: 79 [2019-03-04 16:24:50,882 INFO L226 Difference]: Without dead ends: 77 [2019-03-04 16:24:50,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-03-04 16:24:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 49. [2019-03-04 16:24:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-03-04 16:24:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 214 transitions. [2019-03-04 16:24:50,899 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 214 transitions. Word has length 5 [2019-03-04 16:24:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:50,900 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 214 transitions. [2019-03-04 16:24:50,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:24:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 214 transitions. [2019-03-04 16:24:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:50,901 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:50,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:50,901 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:50,901 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-03-04 16:24:50,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:50,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:50,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:50,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:50,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:50,976 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,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:50,977 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:50,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:50,994 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:24:50,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:51,000 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,026 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:51,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,040 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:51,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,051 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:24:51,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:51,069 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:24:51,069 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,139 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,148 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,158 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,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:51,228 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:51,229 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,255 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,266 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,283 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,311 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:51,312 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:24:51,337 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:24:51,338 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,378 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,379 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:48 [2019-03-04 16:24:51,412 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:24:51,413 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:51,431 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:51,431 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-03-04 16:24:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:51,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:51,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:51,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:51,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:51,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:51,499 INFO L87 Difference]: Start difference. First operand 49 states and 214 transitions. Second operand 8 states. [2019-03-04 16:24:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:51,847 INFO L93 Difference]: Finished difference Result 93 states and 309 transitions. [2019-03-04 16:24:51,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:51,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:51,850 INFO L225 Difference]: With dead ends: 93 [2019-03-04 16:24:51,850 INFO L226 Difference]: Without dead ends: 87 [2019-03-04 16:24:51,851 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:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-03-04 16:24:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 52. [2019-03-04 16:24:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:24:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 242 transitions. [2019-03-04 16:24:51,867 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 242 transitions. Word has length 5 [2019-03-04 16:24:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:51,867 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 242 transitions. [2019-03-04 16:24:51,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 242 transitions. [2019-03-04 16:24:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:51,868 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:51,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:51,869 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-03-04 16:24:51,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:51,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:51,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:51,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:52,099 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-03-04 16:24:52,302 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-03-04 16:24:52,532 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-03-04 16:24:52,703 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,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:52,703 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:52,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:52,727 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:24:52,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:52,759 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:52,760 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,768 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,776 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,792 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,838 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:24:52,840 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:24:52,842 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:52,846 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,891 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:52,892 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,902 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,912 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,922 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,932 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:52,952 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:52,953 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:24:53,081 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-03-04 16:24:53,111 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:24:53,112 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:24:53,149 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:24:53,150 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:76 [2019-03-04 16:24:53,227 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:24:53,228 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,316 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 73 [2019-03-04 16:24:53,318 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2019-03-04 16:24:53,449 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-03-04 16:24:53,450 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:191 [2019-03-04 16:24:53,755 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-03-04 16:24:53,787 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 55 treesize of output 50 [2019-03-04 16:24:53,788 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:53,942 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 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 16:24:53,943 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:54,036 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 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:24:54,037 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:54,135 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 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 53 [2019-03-04 16:24:54,136 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:54,190 INFO L309 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-03-04 16:24:54,190 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:183, output treesize:129 [2019-03-04 16:24:54,283 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:54,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:54,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:54,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:54,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:54,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:54,304 INFO L87 Difference]: Start difference. First operand 52 states and 242 transitions. Second operand 10 states. [2019-03-04 16:24:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:55,254 INFO L93 Difference]: Finished difference Result 113 states and 346 transitions. [2019-03-04 16:24:55,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:24:55,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:55,255 INFO L225 Difference]: With dead ends: 113 [2019-03-04 16:24:55,255 INFO L226 Difference]: Without dead ends: 111 [2019-03-04 16:24:55,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:24:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-03-04 16:24:55,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 55. [2019-03-04 16:24:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-03-04 16:24:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 260 transitions. [2019-03-04 16:24:55,272 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 260 transitions. Word has length 5 [2019-03-04 16:24:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:55,272 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 260 transitions. [2019-03-04 16:24:55,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 260 transitions. [2019-03-04 16:24:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:55,273 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:55,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:55,273 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:55,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:55,274 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-03-04 16:24:55,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:55,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:55,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:55,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:55,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:55,343 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:55,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:55,343 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:55,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:55,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:24:55,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:55,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:24:55,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,387 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:55,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,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:24:55,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,416 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:55,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:55,454 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:55,455 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,469 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,479 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,487 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,498 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,546 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:55,547 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,553 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,560 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,571 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,593 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:55,594 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:24:55,630 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,631 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,648 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,649 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-03-04 16:24:55,677 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 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:24:55,678 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:55,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:24:55,690 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:24:55,707 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:55,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:55,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:55,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:55,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:55,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:55,727 INFO L87 Difference]: Start difference. First operand 55 states and 260 transitions. Second operand 8 states. [2019-03-04 16:24:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:56,044 INFO L93 Difference]: Finished difference Result 80 states and 310 transitions. [2019-03-04 16:24:56,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:56,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:56,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:56,047 INFO L225 Difference]: With dead ends: 80 [2019-03-04 16:24:56,048 INFO L226 Difference]: Without dead ends: 79 [2019-03-04 16:24:56,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:24:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-03-04 16:24:56,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 58. [2019-03-04 16:24:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-03-04 16:24:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 279 transitions. [2019-03-04 16:24:56,063 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 279 transitions. Word has length 5 [2019-03-04 16:24:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:56,064 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 279 transitions. [2019-03-04 16:24:56,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 279 transitions. [2019-03-04 16:24:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:56,064 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:56,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:56,065 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:56,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:56,065 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-03-04 16:24:56,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:56,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:56,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:56,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:56,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:56,213 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:56,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:56,213 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:56,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:56,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:56,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:56,230 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:24:56,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:56,235 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,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,242 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,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,250 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:56,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,262 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,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:56,282 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,282 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,294 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,305 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,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:56,327 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,389 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:24:56,389 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,394 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,403 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,420 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,438 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,468 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:56,469 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:24:56,525 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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,525 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,552 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,552 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:24:56,594 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:24:56,594 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,615 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,615 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:46 [2019-03-04 16:24:56,691 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 49 [2019-03-04 16:24:56,692 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:56,712 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,712 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-03-04 16:24:56,739 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:56,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:56,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:56,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:56,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:56,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:56,758 INFO L87 Difference]: Start difference. First operand 58 states and 279 transitions. Second operand 10 states. [2019-03-04 16:24:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:57,272 INFO L93 Difference]: Finished difference Result 91 states and 358 transitions. [2019-03-04 16:24:57,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:24:57,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:57,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:57,274 INFO L225 Difference]: With dead ends: 91 [2019-03-04 16:24:57,274 INFO L226 Difference]: Without dead ends: 86 [2019-03-04 16:24:57,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:24:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-03-04 16:24:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 63. [2019-03-04 16:24:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-03-04 16:24:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 285 transitions. [2019-03-04 16:24:57,296 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 285 transitions. Word has length 5 [2019-03-04 16:24:57,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:57,297 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 285 transitions. [2019-03-04 16:24:57,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:57,297 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 285 transitions. [2019-03-04 16:24:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:57,297 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:57,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:57,298 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:57,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:57,298 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-03-04 16:24:57,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:57,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:57,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:57,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:57,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:57,354 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:57,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:57,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 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:57,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:57,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:57,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:57,391 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:24:57,391 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,398 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,407 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:57,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:24:57,452 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:24:57,456 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:57,531 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:24:58,060 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:58,060 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,210 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,231 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,241 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,249 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,267 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:58,268 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:24:58,299 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:58,299 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,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:24:58,309 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:24:58,334 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 26 [2019-03-04 16:24:58,334 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:58,342 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,342 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-03-04 16:24:58,356 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:58,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:58,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:58,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:58,377 INFO L87 Difference]: Start difference. First operand 63 states and 285 transitions. Second operand 8 states. [2019-03-04 16:24:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:58,676 INFO L93 Difference]: Finished difference Result 83 states and 310 transitions. [2019-03-04 16:24:58,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:24:58,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:58,677 INFO L225 Difference]: With dead ends: 83 [2019-03-04 16:24:58,677 INFO L226 Difference]: Without dead ends: 82 [2019-03-04 16:24:58,678 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:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-03-04 16:24:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2019-03-04 16:24:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-03-04 16:24:58,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 285 transitions. [2019-03-04 16:24:58,697 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 285 transitions. Word has length 5 [2019-03-04 16:24:58,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:58,697 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 285 transitions. [2019-03-04 16:24:58,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:58,698 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 285 transitions. [2019-03-04 16:24:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:58,698 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:58,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:58,698 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:58,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:58,699 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-03-04 16:24:58,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:58,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:58,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:58,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:58,921 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,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:58,921 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:58,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:58,952 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:24:58,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:59,064 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:24:59,064 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,068 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,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:59,093 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,112 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:24:59,117 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:24:59,120 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:59,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:59,156 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:59,157 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,165 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,175 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,185 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,196 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,219 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:59,220 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:24:59,272 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:59,272 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,289 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:59,290 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:24:59,324 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 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:24:59,324 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,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:59,340 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:24:59,403 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 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:24:59,404 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:59,415 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,416 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:24:59,432 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:59,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:59,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:59,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:59,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:59,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:59,452 INFO L87 Difference]: Start difference. First operand 63 states and 285 transitions. Second operand 10 states. [2019-03-04 16:24:59,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:59,960 INFO L93 Difference]: Finished difference Result 116 states and 433 transitions. [2019-03-04 16:24:59,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:24:59,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:59,963 INFO L225 Difference]: With dead ends: 116 [2019-03-04 16:24:59,963 INFO L226 Difference]: Without dead ends: 115 [2019-03-04 16:24:59,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:24:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-03-04 16:24:59,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 61. [2019-03-04 16:24:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:24:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-03-04 16:24:59,991 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-03-04 16:24:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:59,991 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-03-04 16:24:59,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-03-04 16:24:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:59,992 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:59,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:59,992 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:59,993 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-03-04 16:24:59,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:59,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:59,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:59,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:59,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:00,489 WARN L181 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-03-04 16:25:00,668 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-03-04 16:25:00,683 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:25:00,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:00,684 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:25:00,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:00,715 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:25:00,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:00,833 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:00,834 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,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:00,847 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,858 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,873 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:25:00,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:25:00,878 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:00,881 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:00,946 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:00,947 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,957 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,967 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,977 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:00,987 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,009 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:01,009 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:25:01,069 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 59 [2019-03-04 16:25:01,072 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:25:01,176 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-03-04 16:25:01,176 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-03-04 16:25:01,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, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 53 [2019-03-04 16:25:01,318 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,399 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 5 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:25:01,400 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,479 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 5 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:25:01,479 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:01,527 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-03-04 16:25:01,527 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:100 [2019-03-04 16:25:05,581 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 65 [2019-03-04 16:25:05,620 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 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 45 [2019-03-04 16:25:05,621 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,683 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 55 treesize of output 50 [2019-03-04 16:25:05,684 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,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, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:25:05,794 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:05,835 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-03-04 16:25:05,836 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-03-04 16:25:05,977 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-03-04 16:25:05,979 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:05,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:05,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:05,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:06,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:06,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:06,000 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-03-04 16:25:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:06,758 INFO L93 Difference]: Finished difference Result 138 states and 522 transitions. [2019-03-04 16:25:06,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:25:06,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:25:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:06,761 INFO L225 Difference]: With dead ends: 138 [2019-03-04 16:25:06,761 INFO L226 Difference]: Without dead ends: 137 [2019-03-04 16:25:06,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:25:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-03-04 16:25:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 94. [2019-03-04 16:25:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-03-04 16:25:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 474 transitions. [2019-03-04 16:25:06,797 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 474 transitions. Word has length 5 [2019-03-04 16:25:06,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:06,797 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 474 transitions. [2019-03-04 16:25:06,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 474 transitions. [2019-03-04 16:25:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:06,798 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:06,798 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:06,798 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:06,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:06,798 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-03-04 16:25:06,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:06,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:06,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:06,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:06,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:06,970 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-03-04 16:25:06,986 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:06,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:06,987 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:25:06,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:07,001 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:25:07,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:07,008 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,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,014 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,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,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:25:07,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,033 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,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:07,059 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,059 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,069 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,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:07,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:07,103 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,145 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:07,146 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,152 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,161 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,177 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,196 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,226 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:07,227 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:25:07,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:25:07,251 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,278 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,278 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:25:07,311 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:25:07,312 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:07,335 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,335 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-03-04 16:25:07,353 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,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:07,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:07,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:07,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:07,372 INFO L87 Difference]: Start difference. First operand 94 states and 474 transitions. Second operand 8 states. [2019-03-04 16:25:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:07,893 INFO L93 Difference]: Finished difference Result 121 states and 519 transitions. [2019-03-04 16:25:07,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:07,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:25:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:07,895 INFO L225 Difference]: With dead ends: 121 [2019-03-04 16:25:07,895 INFO L226 Difference]: Without dead ends: 120 [2019-03-04 16:25:07,896 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:25:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-03-04 16:25:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2019-03-04 16:25:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-03-04 16:25:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 492 transitions. [2019-03-04 16:25:07,945 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 492 transitions. Word has length 5 [2019-03-04 16:25:07,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:07,946 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 492 transitions. [2019-03-04 16:25:07,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 492 transitions. [2019-03-04 16:25:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:07,947 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:07,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:07,947 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:07,947 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-03-04 16:25:07,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:07,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:07,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:07,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:07,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:08,168 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-03-04 16:25:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:08,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:08,313 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:25:08,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:08,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:25:08,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:08,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:08,546 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:08,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,557 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:08,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,571 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:08,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:08,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:08,590 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,601 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,628 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,637 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,649 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,687 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:08,687 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,692 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,703 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,720 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,749 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:08,749 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:25:08,773 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:08,774 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:08,816 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:08,816 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-03-04 16:25:08,833 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:08,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:08,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:25:08,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:25:08,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:25:08,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:08,852 INFO L87 Difference]: Start difference. First operand 97 states and 492 transitions. Second operand 6 states. [2019-03-04 16:25:09,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:09,116 INFO L93 Difference]: Finished difference Result 112 states and 527 transitions. [2019-03-04 16:25:09,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:25:09,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:25:09,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:09,118 INFO L225 Difference]: With dead ends: 112 [2019-03-04 16:25:09,118 INFO L226 Difference]: Without dead ends: 111 [2019-03-04 16:25:09,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:09,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-03-04 16:25:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2019-03-04 16:25:09,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-03-04 16:25:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 519 transitions. [2019-03-04 16:25:09,172 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 519 transitions. Word has length 5 [2019-03-04 16:25:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:09,172 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 519 transitions. [2019-03-04 16:25:09,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:25:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 519 transitions. [2019-03-04 16:25:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:09,172 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:09,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:09,173 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:09,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:09,173 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-03-04 16:25:09,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:09,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:09,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:09,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:09,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:09,381 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-03-04 16:25:09,430 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,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:09,431 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:25:09,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:09,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:25:09,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:09,446 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:25:09,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:09,452 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:09,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,460 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:09,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,536 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:09,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,546 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:09,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:09,563 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,563 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,574 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,586 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,596 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,607 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,651 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:09,651 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,657 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,670 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,686 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,705 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,735 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:09,736 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:25:09,767 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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,767 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,796 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,796 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:25:09,839 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:25:09,840 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,862 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,863 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:40 [2019-03-04 16:25:09,941 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:25:09,941 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:09,957 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,958 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-03-04 16:25:09,981 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:10,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:10,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:10,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:10,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:10,001 INFO L87 Difference]: Start difference. First operand 104 states and 519 transitions. Second operand 10 states. [2019-03-04 16:25:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:11,539 INFO L93 Difference]: Finished difference Result 126 states and 549 transitions. [2019-03-04 16:25:11,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:11,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:25:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:11,541 INFO L225 Difference]: With dead ends: 126 [2019-03-04 16:25:11,541 INFO L226 Difference]: Without dead ends: 124 [2019-03-04 16:25:11,542 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:25:11,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-03-04 16:25:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 45. [2019-03-04 16:25:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-03-04 16:25:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 155 transitions. [2019-03-04 16:25:11,573 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 155 transitions. Word has length 5 [2019-03-04 16:25:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:11,573 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 155 transitions. [2019-03-04 16:25:11,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 155 transitions. [2019-03-04 16:25:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:11,574 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:11,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:11,574 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:11,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:11,574 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-03-04 16:25:11,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:11,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:11,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:11,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:11,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:11,725 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-03-04 16:25:11,740 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:11,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:11,741 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:25:11,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:11,755 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:25:11,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:11,762 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,778 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,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,787 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:11,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,798 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:11,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,803 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,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:11,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:11,815 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,825 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,836 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,846 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,857 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,893 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:11,894 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,901 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,912 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,927 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:11,994 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:11,994 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:25:12,117 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:12,117 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,142 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,142 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:25:12,178 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:25:12,179 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,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:12,199 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-03-04 16:25:12,217 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:12,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:12,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:12,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:12,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:12,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:12,236 INFO L87 Difference]: Start difference. First operand 45 states and 155 transitions. Second operand 8 states. [2019-03-04 16:25:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:12,486 INFO L93 Difference]: Finished difference Result 73 states and 195 transitions. [2019-03-04 16:25:12,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:12,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:25:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:12,488 INFO L225 Difference]: With dead ends: 73 [2019-03-04 16:25:12,488 INFO L226 Difference]: Without dead ends: 70 [2019-03-04 16:25:12,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:12,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-03-04 16:25:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2019-03-04 16:25:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-03-04 16:25:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 169 transitions. [2019-03-04 16:25:12,517 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 169 transitions. Word has length 5 [2019-03-04 16:25:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:12,517 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 169 transitions. [2019-03-04 16:25:12,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 169 transitions. [2019-03-04 16:25:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:12,518 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:12,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:12,518 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:12,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:12,519 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-03-04 16:25:12,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:12,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:12,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:12,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:12,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:12,767 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:12,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:12,768 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:25:12,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:12,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:12,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:12,786 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,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,792 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,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,797 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:12,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:12,807 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,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,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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:12,848 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,857 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,868 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,879 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,891 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,923 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:12,923 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,925 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,932 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,942 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,964 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:12,964 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-03-04 16:25:12,989 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:12,989 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,007 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:13,008 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-03-04 16:25:13,036 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 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:25:13,037 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,052 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:13,052 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-03-04 16:25:13,066 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:13,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:13,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:13,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:13,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:13,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:13,089 INFO L87 Difference]: Start difference. First operand 49 states and 169 transitions. Second operand 8 states. [2019-03-04 16:25:13,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:13,356 INFO L93 Difference]: Finished difference Result 80 states and 212 transitions. [2019-03-04 16:25:13,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:13,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:25:13,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:13,358 INFO L225 Difference]: With dead ends: 80 [2019-03-04 16:25:13,358 INFO L226 Difference]: Without dead ends: 79 [2019-03-04 16:25:13,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-03-04 16:25:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 50. [2019-03-04 16:25:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-03-04 16:25:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 175 transitions. [2019-03-04 16:25:13,387 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 175 transitions. Word has length 5 [2019-03-04 16:25:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:13,387 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 175 transitions. [2019-03-04 16:25:13,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 175 transitions. [2019-03-04 16:25:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:13,388 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:13,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:13,388 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:13,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:13,389 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-03-04 16:25:13,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:13,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:13,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:13,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:13,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:13,490 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:13,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:13,491 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:25:13,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:13,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:25:13,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:13,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:13,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,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:25:13,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,530 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:13,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,550 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:13,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:13,590 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:13,591 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,600 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,611 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,621 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,632 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,666 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:13,666 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,671 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,680 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,691 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,713 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:13,713 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:25:13,751 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:13,752 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,771 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:13,771 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:25:13,803 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 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:25:13,803 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,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:25:13,817 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-03-04 16:25:13,834 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:13,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:13,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-03-04 16:25:13,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:25:13,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:25:13,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:13,855 INFO L87 Difference]: Start difference. First operand 50 states and 175 transitions. Second operand 9 states. [2019-03-04 16:25:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:14,165 INFO L93 Difference]: Finished difference Result 72 states and 205 transitions. [2019-03-04 16:25:14,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:14,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-03-04 16:25:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:14,166 INFO L225 Difference]: With dead ends: 72 [2019-03-04 16:25:14,166 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 16:25:14,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 16:25:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-03-04 16:25:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-03-04 16:25:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 181 transitions. [2019-03-04 16:25:14,193 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 181 transitions. Word has length 5 [2019-03-04 16:25:14,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:14,193 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 181 transitions. [2019-03-04 16:25:14,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:25:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 181 transitions. [2019-03-04 16:25:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:14,194 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:14,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:14,194 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:14,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:14,195 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-03-04 16:25:14,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:14,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:14,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:14,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:14,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:25:14,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:25:14,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:25:14,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:25:14,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:25:14,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:25:14,249 INFO L87 Difference]: Start difference. First operand 51 states and 181 transitions. Second operand 4 states. [2019-03-04 16:25:14,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:14,321 INFO L93 Difference]: Finished difference Result 57 states and 191 transitions. [2019-03-04 16:25:14,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:25:14,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:25:14,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:14,322 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:25:14,322 INFO L226 Difference]: Without dead ends: 54 [2019-03-04 16:25:14,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:25:14,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-03-04 16:25:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-03-04 16:25:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-03-04 16:25:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 184 transitions. [2019-03-04 16:25:14,353 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 184 transitions. Word has length 5 [2019-03-04 16:25:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:14,354 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 184 transitions. [2019-03-04 16:25:14,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:25:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 184 transitions. [2019-03-04 16:25:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:25:14,354 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:14,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:25:14,354 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:14,354 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2019-03-04 16:25:14,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:14,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:14,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:14,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:14,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:14,399 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,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:14,400 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:25:14,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:14,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:25:14,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:14,438 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:25:14,438 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,445 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,459 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,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:25:14,494 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:25:14,499 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:14,505 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:14,545 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:14,546 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,556 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,565 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,575 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,585 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,605 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:14,605 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-03-04 16:25:14,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, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:25:14,631 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:14,647 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,647 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-03-04 16:25:14,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, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 36 [2019-03-04 16:25:14,683 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:14,722 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:25:14,723 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:50 [2019-03-04 16:25:14,753 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,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:14,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:14,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:14,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:14,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:14,773 INFO L87 Difference]: Start difference. First operand 50 states and 184 transitions. Second operand 8 states. [2019-03-04 16:25:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:15,067 INFO L93 Difference]: Finished difference Result 73 states and 220 transitions. [2019-03-04 16:25:15,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:15,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:25:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:15,069 INFO L225 Difference]: With dead ends: 73 [2019-03-04 16:25:15,069 INFO L226 Difference]: Without dead ends: 72 [2019-03-04 16:25:15,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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:15,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-03-04 16:25:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2019-03-04 16:25:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:25:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 196 transitions. [2019-03-04 16:25:15,101 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 196 transitions. Word has length 5 [2019-03-04 16:25:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:15,102 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 196 transitions. [2019-03-04 16:25:15,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 196 transitions. [2019-03-04 16:25:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:15,102 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:15,103 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:25:15,103 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:15,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:15,103 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-03-04 16:25:15,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:15,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:15,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:15,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:15,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:15,234 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:15,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:15,235 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:25:15,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:15,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:25:15,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:15,262 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,281 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:15,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,287 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:15,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,298 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:15,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:15,343 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:15,344 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,353 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,364 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,375 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,386 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,412 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:25:15,412 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,418 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,427 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,447 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:15,447 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-03-04 16:25:15,474 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:15,474 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,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:25:15,485 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:25:15,515 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 6 case distinctions, treesize of input 28 treesize of output 29 [2019-03-04 16:25:15,516 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:15,522 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,522 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:25:15,539 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:15,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:15,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:15,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:15,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:15,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:15,559 INFO L87 Difference]: Start difference. First operand 52 states and 196 transitions. Second operand 8 states. [2019-03-04 16:25:15,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:15,904 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-03-04 16:25:15,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:15,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:25:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:15,906 INFO L225 Difference]: With dead ends: 77 [2019-03-04 16:25:15,906 INFO L226 Difference]: Without dead ends: 76 [2019-03-04 16:25:15,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-03-04 16:25:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58. [2019-03-04 16:25:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-03-04 16:25:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 232 transitions. [2019-03-04 16:25:15,955 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 232 transitions. Word has length 6 [2019-03-04 16:25:15,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:15,955 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 232 transitions. [2019-03-04 16:25:15,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 232 transitions. [2019-03-04 16:25:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:15,956 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:15,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:15,956 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:15,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-03-04 16:25:15,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:15,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:15,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:15,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:15,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:16,060 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:16,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:16,061 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:25:16,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:16,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:25:16,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:16,110 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:16,111 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,120 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,129 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,143 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,161 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,186 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:25:16,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:25:16,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:16,197 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:16,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, 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,201 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,245 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,255 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,265 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,276 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,306 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:16,306 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:25:16,369 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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,370 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,501 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,501 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:25:16,543 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:25:16,543 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,566 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,566 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-03-04 16:25:16,622 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:25:16,623 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:16,639 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:16,639 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-03-04 16:25:16,661 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,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:16,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:16,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:16,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:16,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:16,679 INFO L87 Difference]: Start difference. First operand 58 states and 232 transitions. Second operand 10 states. [2019-03-04 16:25:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:17,221 INFO L93 Difference]: Finished difference Result 92 states and 295 transitions. [2019-03-04 16:25:17,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:17,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:17,223 INFO L225 Difference]: With dead ends: 92 [2019-03-04 16:25:17,223 INFO L226 Difference]: Without dead ends: 91 [2019-03-04 16:25:17,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 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:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-03-04 16:25:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 58. [2019-03-04 16:25:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-03-04 16:25:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 232 transitions. [2019-03-04 16:25:17,273 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 232 transitions. Word has length 6 [2019-03-04 16:25:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:17,273 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 232 transitions. [2019-03-04 16:25:17,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 232 transitions. [2019-03-04 16:25:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:17,273 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:17,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:17,274 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:17,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:17,274 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-03-04 16:25:17,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:17,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:17,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:17,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:17,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:17,323 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,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:17,324 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:25:17,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:17,340 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:17,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:17,377 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:17,377 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,385 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,396 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,413 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,437 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:25:17,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, 6 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:17,499 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:17,568 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:17,588 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:17,588 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,598 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,608 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,618 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,628 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,656 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:17,657 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:25:17,703 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:17,703 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,720 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:17,720 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:25:17,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, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:17,755 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,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:25:17,769 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:25:17,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, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:25:17,811 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,821 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:17,821 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:25:17,838 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,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:17,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:17,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:17,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:17,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:17,857 INFO L87 Difference]: Start difference. First operand 58 states and 232 transitions. Second operand 10 states. [2019-03-04 16:25:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:18,296 INFO L93 Difference]: Finished difference Result 94 states and 297 transitions. [2019-03-04 16:25:18,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:18,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:18,298 INFO L225 Difference]: With dead ends: 94 [2019-03-04 16:25:18,298 INFO L226 Difference]: Without dead ends: 93 [2019-03-04 16:25:18,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-03-04 16:25:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 59. [2019-03-04 16:25:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-03-04 16:25:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-03-04 16:25:18,365 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-03-04 16:25:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:18,365 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-03-04 16:25:18,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-03-04 16:25:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:18,366 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:18,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:18,366 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-03-04 16:25:18,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:18,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:18,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:18,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:18,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:18,484 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:18,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:18,484 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:25:18,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:18,497 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:25:18,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:18,507 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,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,512 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:18,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,521 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:18,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,539 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:18,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:18,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, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:18,588 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,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:18,609 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,620 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,630 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,669 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:18,669 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,674 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,684 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,695 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,716 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:18,717 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:25:18,767 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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,768 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,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:18,786 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:25:18,819 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 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:18,819 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,836 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,836 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:25:18,880 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 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:25:18,881 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:18,891 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,892 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:25:18,922 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:18,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:18,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:18,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:18,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:18,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:18,942 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 10 states. [2019-03-04 16:25:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:19,503 INFO L93 Difference]: Finished difference Result 95 states and 303 transitions. [2019-03-04 16:25:19,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:19,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:19,505 INFO L225 Difference]: With dead ends: 95 [2019-03-04 16:25:19,505 INFO L226 Difference]: Without dead ends: 94 [2019-03-04 16:25:19,506 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:19,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-03-04 16:25:19,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-03-04 16:25:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:25:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 250 transitions. [2019-03-04 16:25:19,569 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 250 transitions. Word has length 6 [2019-03-04 16:25:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:19,569 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 250 transitions. [2019-03-04 16:25:19,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 250 transitions. [2019-03-04 16:25:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:19,570 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:19,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:19,570 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:19,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:19,570 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2019-03-04 16:25:19,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:19,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:19,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:19,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:19,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:19,687 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:25:19,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:19,688 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:25:19,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:19,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:25:19,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:19,704 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,723 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,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,734 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:19,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,746 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:19,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:19,784 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:19,785 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,794 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,803 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,813 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,822 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,847 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:25:19,847 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,852 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,861 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,881 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:19,882 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:25:19,915 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:19,915 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,926 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,926 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:25:19,954 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:19,954 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,962 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,962 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:25:19,996 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 6 case distinctions, treesize of input 30 treesize of output 35 [2019-03-04 16:25:19,997 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,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:20,007 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:25:20,037 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,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:20,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:20,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:20,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:20,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:20,056 INFO L87 Difference]: Start difference. First operand 61 states and 250 transitions. Second operand 10 states. [2019-03-04 16:25:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:20,489 INFO L93 Difference]: Finished difference Result 119 states and 372 transitions. [2019-03-04 16:25:20,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:20,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:20,491 INFO L225 Difference]: With dead ends: 119 [2019-03-04 16:25:20,491 INFO L226 Difference]: Without dead ends: 118 [2019-03-04 16:25:20,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-03-04 16:25:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 64. [2019-03-04 16:25:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-03-04 16:25:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 268 transitions. [2019-03-04 16:25:20,569 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 268 transitions. Word has length 6 [2019-03-04 16:25:20,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:20,570 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 268 transitions. [2019-03-04 16:25:20,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:20,570 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 268 transitions. [2019-03-04 16:25:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:20,570 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:20,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:20,571 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:20,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:20,571 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-03-04 16:25:20,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:20,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:20,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:20,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:20,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:20,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:20,653 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:25:20,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:20,667 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:25:20,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:20,697 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:20,698 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,712 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,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:20,746 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,772 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:25:20,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, 6 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:20,790 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:20,794 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:20,799 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:20,800 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,810 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,820 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,830 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,838 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,866 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:20,867 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:25:20,902 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:20,903 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,919 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,920 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:25:20,948 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 5 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:25:20,949 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,960 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,960 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-03-04 16:25:20,977 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:20,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:20,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:20,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:20,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:20,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:20,996 INFO L87 Difference]: Start difference. First operand 64 states and 268 transitions. Second operand 8 states. [2019-03-04 16:25:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:21,326 INFO L93 Difference]: Finished difference Result 88 states and 295 transitions. [2019-03-04 16:25:21,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:21,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:25:21,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:21,328 INFO L225 Difference]: With dead ends: 88 [2019-03-04 16:25:21,328 INFO L226 Difference]: Without dead ends: 87 [2019-03-04 16:25:21,328 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:25:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-03-04 16:25:21,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2019-03-04 16:25:21,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-03-04 16:25:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 268 transitions. [2019-03-04 16:25:21,399 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 268 transitions. Word has length 6 [2019-03-04 16:25:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:21,399 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 268 transitions. [2019-03-04 16:25:21,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 268 transitions. [2019-03-04 16:25:21,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:21,400 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:21,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:21,400 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-03-04 16:25:21,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:21,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:21,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:21,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:21,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:21,471 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:21,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:21,471 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:25:21,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:21,485 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:25:21,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:21,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:25:21,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,498 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:21,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,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:25:21,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,526 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:21,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:21,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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:21,566 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,577 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,588 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,599 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,609 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,643 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:21,643 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,646 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,653 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,664 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,688 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:21,688 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-03-04 16:25:21,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, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 36 treesize of output 59 [2019-03-04 16:25:21,749 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:25:21,848 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-03-04 16:25:21,849 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-03-04 16:25:22,001 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 71 [2019-03-04 16:25:22,042 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 55 treesize of output 50 [2019-03-04 16:25:22,042 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,196 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 43 treesize of output 55 [2019-03-04 16:25:22,196 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,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, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:25:22,267 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,313 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-03-04 16:25:22,314 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:92 [2019-03-04 16:25:22,415 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 48 [2019-03-04 16:25:22,415 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,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, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 40 [2019-03-04 16:25:22,510 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,574 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 5 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:25:22,575 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,617 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-03-04 16:25:22,618 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:88 [2019-03-04 16:25:22,665 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:22,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:22,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:22,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:22,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:22,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:22,685 INFO L87 Difference]: Start difference. First operand 64 states and 268 transitions. Second operand 10 states. [2019-03-04 16:25:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:23,723 INFO L93 Difference]: Finished difference Result 112 states and 368 transitions. [2019-03-04 16:25:23,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:23,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:23,725 INFO L225 Difference]: With dead ends: 112 [2019-03-04 16:25:23,725 INFO L226 Difference]: Without dead ends: 111 [2019-03-04 16:25:23,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:25:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-03-04 16:25:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 67. [2019-03-04 16:25:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-03-04 16:25:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 286 transitions. [2019-03-04 16:25:23,832 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 286 transitions. Word has length 6 [2019-03-04 16:25:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:23,833 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 286 transitions. [2019-03-04 16:25:23,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 286 transitions. [2019-03-04 16:25:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:23,833 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:23,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:23,833 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:23,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:23,834 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-03-04 16:25:23,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:23,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:23,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:23,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:23,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:23,882 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:23,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:23,883 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:25:23,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:23,897 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:25:23,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:23,906 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,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,913 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,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,926 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,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,959 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,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:23,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,004 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:24,004 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,016 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,027 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,038 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,050 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,094 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:24,094 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,101 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,110 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,128 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,158 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,195 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:24,195 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:25:24,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 36 treesize of output 31 [2019-03-04 16:25:24,234 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,268 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:24,268 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:25:24,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:25:24,480 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,516 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:24,516 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-03-04 16:25:24,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, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:25:24,567 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,586 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:24,586 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:25:26,622 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:26,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:26,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:25:26,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:25:26,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:25:26,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=46, Unknown=1, NotChecked=0, Total=72 [2019-03-04 16:25:26,641 INFO L87 Difference]: Start difference. First operand 67 states and 286 transitions. Second operand 9 states. [2019-03-04 16:25:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:27,139 INFO L93 Difference]: Finished difference Result 102 states and 348 transitions. [2019-03-04 16:25:27,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:27,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:25:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:27,141 INFO L225 Difference]: With dead ends: 102 [2019-03-04 16:25:27,141 INFO L226 Difference]: Without dead ends: 101 [2019-03-04 16:25:27,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=43, Invalid=88, Unknown=1, NotChecked=0, Total=132 [2019-03-04 16:25:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-03-04 16:25:27,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2019-03-04 16:25:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-03-04 16:25:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 310 transitions. [2019-03-04 16:25:27,305 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 310 transitions. Word has length 6 [2019-03-04 16:25:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:27,305 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 310 transitions. [2019-03-04 16:25:27,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:25:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 310 transitions. [2019-03-04 16:25:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:27,306 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:27,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:27,307 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:27,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-03-04 16:25:27,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:27,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:27,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:27,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:27,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:27,535 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:25:27,614 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:25:27,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:27,615 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:25:27,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:27,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:27,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:27,633 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:25:27,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:27,661 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:27,662 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,664 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,670 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,682 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,701 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,725 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:25:27,729 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:25:27,733 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:27,736 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:27,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, 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:27,740 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,757 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,767 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,778 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,788 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,819 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:27,820 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:25:27,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 36 treesize of output 31 [2019-03-04 16:25:27,842 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,870 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,871 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-03-04 16:25:27,907 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:25:27,907 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,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:27,928 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:40 [2019-03-04 16:25:27,971 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:25:27,972 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,986 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,987 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-03-04 16:25:28,004 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:28,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:28,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:28,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:28,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:28,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:28,023 INFO L87 Difference]: Start difference. First operand 71 states and 310 transitions. Second operand 10 states. [2019-03-04 16:25:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:28,679 INFO L93 Difference]: Finished difference Result 142 states and 537 transitions. [2019-03-04 16:25:28,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:25:28,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:28,681 INFO L225 Difference]: With dead ends: 142 [2019-03-04 16:25:28,681 INFO L226 Difference]: Without dead ends: 141 [2019-03-04 16:25:28,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-03-04 16:25:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 99. [2019-03-04 16:25:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-03-04 16:25:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 478 transitions. [2019-03-04 16:25:28,841 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 478 transitions. Word has length 6 [2019-03-04 16:25:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:28,841 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 478 transitions. [2019-03-04 16:25:28,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 478 transitions. [2019-03-04 16:25:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:28,842 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:28,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:28,842 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:28,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-03-04 16:25:28,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:28,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:28,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:28,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:28,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:29,010 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:29,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:29,010 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:25:29,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:29,026 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:25:29,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:29,030 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:25:29,045 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:29,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,053 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:29,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,067 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:29,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:29,086 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:29,086 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,096 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,107 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,119 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,130 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,194 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:29,195 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,201 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,211 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,227 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,265 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:29,265 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:25:29,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, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:29,299 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,333 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:29,333 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:25:29,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, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:25:29,391 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:29,442 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:25:29,442 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-03-04 16:25:29,483 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:29,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:29,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:29,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:29,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:29,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:29,502 INFO L87 Difference]: Start difference. First operand 99 states and 478 transitions. Second operand 8 states. [2019-03-04 16:25:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:29,980 INFO L93 Difference]: Finished difference Result 133 states and 565 transitions. [2019-03-04 16:25:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:29,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:25:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:29,983 INFO L225 Difference]: With dead ends: 133 [2019-03-04 16:25:29,983 INFO L226 Difference]: Without dead ends: 132 [2019-03-04 16:25:29,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 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:25:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-03-04 16:25:30,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 108. [2019-03-04 16:25:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:25:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 541 transitions. [2019-03-04 16:25:30,148 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 541 transitions. Word has length 6 [2019-03-04 16:25:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:30,148 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 541 transitions. [2019-03-04 16:25:30,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 541 transitions. [2019-03-04 16:25:30,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:30,149 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:30,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:30,149 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:30,150 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-03-04 16:25:30,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:30,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:30,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:30,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:30,243 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:30,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:30,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 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:25:30,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:30,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:25:30,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:30,276 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:25:30,276 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,281 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,291 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,303 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:25:30,315 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:25:30,318 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:30,323 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:30,357 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:30,358 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,366 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,375 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,393 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,403 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,422 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:30,423 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:25:30,455 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:30,456 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,466 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,467 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-03-04 16:25:30,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, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:25:30,493 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,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:25:30,501 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2019-03-04 16:25:30,514 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:30,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:30,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:30,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:30,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:30,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:30,533 INFO L87 Difference]: Start difference. First operand 108 states and 541 transitions. Second operand 8 states. [2019-03-04 16:25:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:30,976 INFO L93 Difference]: Finished difference Result 149 states and 617 transitions. [2019-03-04 16:25:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:30,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:25:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:30,979 INFO L225 Difference]: With dead ends: 149 [2019-03-04 16:25:30,979 INFO L226 Difference]: Without dead ends: 148 [2019-03-04 16:25:30,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:30,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-03-04 16:25:31,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 107. [2019-03-04 16:25:31,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-03-04 16:25:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 535 transitions. [2019-03-04 16:25:31,157 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 535 transitions. Word has length 6 [2019-03-04 16:25:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:31,157 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 535 transitions. [2019-03-04 16:25:31,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 535 transitions. [2019-03-04 16:25:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:31,158 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:31,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:31,158 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:31,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:31,158 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-03-04 16:25:31,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:31,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:31,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:31,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:31,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:25:31,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:25:31,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:25:31,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:25:31,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:25:31,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:25:31,274 INFO L87 Difference]: Start difference. First operand 107 states and 535 transitions. Second operand 5 states. [2019-03-04 16:25:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:31,609 INFO L93 Difference]: Finished difference Result 158 states and 696 transitions. [2019-03-04 16:25:31,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:25:31,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-03-04 16:25:31,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:31,612 INFO L225 Difference]: With dead ends: 158 [2019-03-04 16:25:31,612 INFO L226 Difference]: Without dead ends: 157 [2019-03-04 16:25:31,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:31,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-03-04 16:25:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2019-03-04 16:25:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-03-04 16:25:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 553 transitions. [2019-03-04 16:25:31,788 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 553 transitions. Word has length 6 [2019-03-04 16:25:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:31,789 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 553 transitions. [2019-03-04 16:25:31,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:25:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 553 transitions. [2019-03-04 16:25:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:31,790 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:31,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:31,790 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:31,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:31,790 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-03-04 16:25:31,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:31,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:31,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:31,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:31,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:31,886 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:31,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:31,886 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:25:31,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:31,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:25:31,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:31,921 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:25:31,921 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:31,929 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,943 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,955 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:25:31,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, 4 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,972 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:31,977 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:32,011 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:32,012 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:32,019 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:32,029 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:32,039 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:32,049 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:32,068 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:32,068 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:25:32,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, 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:32,098 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:32,108 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:32,108 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-03-04 16:25:32,137 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:25:32,138 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:32,147 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:32,147 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:25:32,163 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:32,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:32,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:32,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:32,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:32,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:32,182 INFO L87 Difference]: Start difference. First operand 110 states and 553 transitions. Second operand 8 states. [2019-03-04 16:25:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:32,578 INFO L93 Difference]: Finished difference Result 120 states and 566 transitions. [2019-03-04 16:25:32,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:32,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:25:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:32,580 INFO L225 Difference]: With dead ends: 120 [2019-03-04 16:25:32,580 INFO L226 Difference]: Without dead ends: 119 [2019-03-04 16:25:32,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-03-04 16:25:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2019-03-04 16:25:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:25:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 550 transitions. [2019-03-04 16:25:32,878 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 550 transitions. Word has length 6 [2019-03-04 16:25:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:32,878 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 550 transitions. [2019-03-04 16:25:32,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 550 transitions. [2019-03-04 16:25:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:32,879 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:32,880 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:25:32,880 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:32,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:32,880 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-03-04 16:25:32,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:32,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:32,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:33,178 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,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:33,179 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:25:33,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:33,213 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:33,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:33,245 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,410 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:33,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:33,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:33,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,510 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:33,510 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,526 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,536 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,545 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,556 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,590 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:33,591 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,599 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,610 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,626 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,655 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:33,655 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:25:33,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, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:25:33,686 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:33,730 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:25:33,731 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 16:25:33,776 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:25:33,777 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,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:25:33,792 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-03-04 16:25:33,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, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 41 [2019-03-04 16:25:33,837 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,846 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,847 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:25:33,862 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,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:33,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:25:33,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:25:33,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:25:33,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:33,881 INFO L87 Difference]: Start difference. First operand 108 states and 550 transitions. Second operand 9 states. [2019-03-04 16:25:34,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:34,541 INFO L93 Difference]: Finished difference Result 190 states and 822 transitions. [2019-03-04 16:25:34,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:34,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:25:34,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:34,544 INFO L225 Difference]: With dead ends: 190 [2019-03-04 16:25:34,544 INFO L226 Difference]: Without dead ends: 187 [2019-03-04 16:25:34,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:34,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-03-04 16:25:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 118. [2019-03-04 16:25:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-03-04 16:25:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 610 transitions. [2019-03-04 16:25:34,736 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 610 transitions. Word has length 6 [2019-03-04 16:25:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:34,736 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 610 transitions. [2019-03-04 16:25:34,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:25:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 610 transitions. [2019-03-04 16:25:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:34,736 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:34,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:34,737 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:34,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:34,737 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-03-04 16:25:34,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:34,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:34,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:34,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:34,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:34,815 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:34,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:34,815 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:25:34,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:25:34,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:25:34,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:34,833 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:25:34,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:34,868 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,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,908 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,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,933 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,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,942 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,945 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,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,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, 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,962 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,972 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,984 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,995 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,006 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,049 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:35,050 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,052 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,062 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,076 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,096 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,129 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:35,129 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-03-04 16:25:35,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:25:35,165 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,194 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,195 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:25:35,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, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:25:35,228 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,251 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:35,252 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-03-04 16:25:35,295 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:25:35,296 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,312 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:35,313 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-03-04 16:25:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:35,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:35,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:35,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:35,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:35,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:35,349 INFO L87 Difference]: Start difference. First operand 118 states and 610 transitions. Second operand 10 states. [2019-03-04 16:25:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:36,024 INFO L93 Difference]: Finished difference Result 174 states and 764 transitions. [2019-03-04 16:25:36,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:36,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:36,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:36,027 INFO L225 Difference]: With dead ends: 174 [2019-03-04 16:25:36,027 INFO L226 Difference]: Without dead ends: 171 [2019-03-04 16:25:36,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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:25:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-03-04 16:25:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 131. [2019-03-04 16:25:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-03-04 16:25:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 688 transitions. [2019-03-04 16:25:36,254 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 688 transitions. Word has length 6 [2019-03-04 16:25:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:36,254 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 688 transitions. [2019-03-04 16:25:36,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 688 transitions. [2019-03-04 16:25:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:36,255 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:36,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:36,255 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:36,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:36,255 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-03-04 16:25:36,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:36,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:36,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:36,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:25:36,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:36,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:36,341 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:25:36,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:36,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:25:36,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:36,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:25:36,381 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:36,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,388 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:36,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,400 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:36,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:36,417 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:36,418 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,429 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,440 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,451 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,460 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,496 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:36,497 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,504 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,515 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,532 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,560 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:36,560 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:25:36,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, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:36,678 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,710 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,710 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:25:36,747 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:25:36,748 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,767 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,768 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:36 [2019-03-04 16:25:36,784 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:36,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:36,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:36,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:36,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:36,804 INFO L87 Difference]: Start difference. First operand 131 states and 688 transitions. Second operand 8 states. [2019-03-04 16:25:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:37,452 INFO L93 Difference]: Finished difference Result 231 states and 1103 transitions. [2019-03-04 16:25:37,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:37,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:25:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:37,455 INFO L225 Difference]: With dead ends: 231 [2019-03-04 16:25:37,455 INFO L226 Difference]: Without dead ends: 226 [2019-03-04 16:25:37,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-03-04 16:25:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 179. [2019-03-04 16:25:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-03-04 16:25:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 975 transitions. [2019-03-04 16:25:37,820 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 975 transitions. Word has length 6 [2019-03-04 16:25:37,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:37,820 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 975 transitions. [2019-03-04 16:25:37,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 975 transitions. [2019-03-04 16:25:37,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:25:37,821 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:37,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:25:37,821 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:37,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:37,821 INFO L82 PathProgramCache]: Analyzing trace with hash 901039174, now seen corresponding path program 1 times [2019-03-04 16:25:37,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:37,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:37,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:37,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:37,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:37,931 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:25:37,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:37,932 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:25:37,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:37,948 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:37,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:37,958 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,977 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,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,985 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:37,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:37,998 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:38,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,014 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:38,014 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,026 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,037 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,046 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,058 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,096 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:38,096 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,101 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,110 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,126 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,155 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:38,156 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:25:38,182 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:25:38,182 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,210 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,210 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:25:38,247 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:25:38,248 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,267 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:38,267 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-03-04 16:25:38,329 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 36 treesize of output 52 [2019-03-04 16:25:38,330 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:38,373 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:25:38,374 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:68 [2019-03-04 16:25:38,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:38,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:38,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:38,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:38,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:38,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:38,434 INFO L87 Difference]: Start difference. First operand 179 states and 975 transitions. Second operand 10 states. [2019-03-04 16:25:39,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:39,466 INFO L93 Difference]: Finished difference Result 315 states and 1626 transitions. [2019-03-04 16:25:39,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:39,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:25:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:39,472 INFO L225 Difference]: With dead ends: 315 [2019-03-04 16:25:39,472 INFO L226 Difference]: Without dead ends: 314 [2019-03-04 16:25:39,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:39,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-03-04 16:25:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-03-04 16:25:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-03-04 16:25:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 1119 transitions. [2019-03-04 16:25:39,909 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 1119 transitions. Word has length 6 [2019-03-04 16:25:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:39,909 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 1119 transitions. [2019-03-04 16:25:39,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 1119 transitions. [2019-03-04 16:25:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:39,910 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:39,910 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:25:39,911 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:39,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-03-04 16:25:39,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:39,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:39,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:40,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:40,067 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:25:40,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:40,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:25:40,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:40,087 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:40,101 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:40,116 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:40,156 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:40,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, 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:40,195 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,202 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,212 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,222 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,232 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,242 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,242 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-03-04 16:25:40,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, 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:40,248 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,249 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,250 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-03-04 16:25:40,256 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 18 treesize of output 13 [2019-03-04 16:25:40,256 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,258 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,258 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2019-03-04 16:25:40,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:25:40,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:40,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-03-04 16:25:40,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:25:40,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:25:40,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:25:40,284 INFO L87 Difference]: Start difference. First operand 203 states and 1119 transitions. Second operand 7 states. [2019-03-04 16:25:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:41,182 INFO L93 Difference]: Finished difference Result 381 states and 2059 transitions. [2019-03-04 16:25:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:41,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:25:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:41,186 INFO L225 Difference]: With dead ends: 381 [2019-03-04 16:25:41,186 INFO L226 Difference]: Without dead ends: 374 [2019-03-04 16:25:41,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:25:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-03-04 16:25:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 359. [2019-03-04 16:25:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-03-04 16:25:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 2030 transitions. [2019-03-04 16:25:41,979 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 2030 transitions. Word has length 7 [2019-03-04 16:25:41,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:41,979 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 2030 transitions. [2019-03-04 16:25:41,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:25:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 2030 transitions. [2019-03-04 16:25:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:41,980 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:41,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:41,981 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-03-04 16:25:41,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:41,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:41,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:41,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:41,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:42,127 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:42,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:42,127 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:42,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:42,140 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:25:42,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:42,147 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,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,152 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,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,160 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,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,171 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,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,188 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,189 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,200 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,212 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,224 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,235 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,279 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:25:42,279 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,286 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,309 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,320 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,338 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,369 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,369 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-03-04 16:25:42,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 36 treesize of output 31 [2019-03-04 16:25:42,408 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,437 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,438 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:25:42,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, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:25:42,479 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,499 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,500 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:25:42,548 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:25:42,548 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,566 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,566 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-03-04 16:25:42,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, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 54 [2019-03-04 16:25:42,639 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,656 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,657 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-03-04 16:25:42,687 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:42,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:42,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:42,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:42,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:42,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:42,706 INFO L87 Difference]: Start difference. First operand 359 states and 2030 transitions. Second operand 12 states. [2019-03-04 16:25:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:44,286 INFO L93 Difference]: Finished difference Result 397 states and 2111 transitions. [2019-03-04 16:25:44,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:44,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:25:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:44,291 INFO L225 Difference]: With dead ends: 397 [2019-03-04 16:25:44,291 INFO L226 Difference]: Without dead ends: 396 [2019-03-04 16:25:44,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:25:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-03-04 16:25:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 333. [2019-03-04 16:25:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-03-04 16:25:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1874 transitions. [2019-03-04 16:25:45,025 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1874 transitions. Word has length 7 [2019-03-04 16:25:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:45,025 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 1874 transitions. [2019-03-04 16:25:45,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:25:45,025 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1874 transitions. [2019-03-04 16:25:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:45,027 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:45,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:45,027 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:45,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:45,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-03-04 16:25:45,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:45,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:45,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:45,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:45,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:45,212 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:45,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:45,213 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:45,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:45,227 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:45,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:45,234 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,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:25:45,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,259 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:45,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,272 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:45,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:45,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:25:45,290 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,300 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,310 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,320 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,330 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,365 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:45,366 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,370 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,380 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,396 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,425 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:45,425 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:25:45,469 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:45,470 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,487 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,488 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:25:45,518 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 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:25:45,519 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,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:25:45,530 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:25:45,577 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 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:25:45,578 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:45,589 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,589 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:25:45,606 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:45,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:45,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:25:45,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:25:45,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:25:45,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:45,627 INFO L87 Difference]: Start difference. First operand 333 states and 1874 transitions. Second operand 10 states. [2019-03-04 16:25:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:47,054 INFO L93 Difference]: Finished difference Result 461 states and 2452 transitions. [2019-03-04 16:25:47,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:25:47,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:25:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:47,058 INFO L225 Difference]: With dead ends: 461 [2019-03-04 16:25:47,058 INFO L226 Difference]: Without dead ends: 460 [2019-03-04 16:25:47,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:25:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-03-04 16:25:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 362. [2019-03-04 16:25:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-03-04 16:25:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 2050 transitions. [2019-03-04 16:25:47,995 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 2050 transitions. Word has length 7 [2019-03-04 16:25:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:47,996 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 2050 transitions. [2019-03-04 16:25:47,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:25:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 2050 transitions. [2019-03-04 16:25:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:47,997 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:47,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:47,997 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:47,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:47,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2018049690, now seen corresponding path program 1 times [2019-03-04 16:25:47,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:47,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:47,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:47,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:47,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:48,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:48,184 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:48,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:48,198 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:25:48,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:48,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:25:48,223 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:48,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,232 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:25:48,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,249 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:25:48,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:48,291 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:48,292 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,304 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,316 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,328 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,341 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,379 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:25:48,379 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,386 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,396 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,417 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:48,417 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:44, output treesize:46 [2019-03-04 16:25:48,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, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:25:48,463 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:48,492 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 2 xjuncts. [2019-03-04 16:25:48,493 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:50 [2019-03-04 16:25:48,556 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 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 53 [2019-03-04 16:25:48,558 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-03-04 16:25:48,646 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 6 case distinctions, treesize of input 32 treesize of output 41 [2019-03-04 16:25:48,647 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,692 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-03-04 16:25:48,692 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:70, output treesize:92 [2019-03-04 16:25:48,772 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 33 [2019-03-04 16:25:48,773 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,857 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 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:25:48,858 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,934 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 37 [2019-03-04 16:25:48,935 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:48,991 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 38 treesize of output 33 [2019-03-04 16:25:48,991 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:49,035 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-03-04 16:25:49,035 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:132, output treesize:98 [2019-03-04 16:25:49,102 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 30 [2019-03-04 16:25:49,103 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:49,175 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 6 case distinctions, treesize of input 34 treesize of output 35 [2019-03-04 16:25:49,176 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:49,254 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 4 new quantified variables, introduced 11 case distinctions, treesize of input 39 treesize of output 47 [2019-03-04 16:25:49,255 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:49,382 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 30 [2019-03-04 16:25:49,382 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:49,424 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-1 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2019-03-04 16:25:49,424 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:138, output treesize:94 [2019-03-04 16:25:49,481 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,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:49,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:49,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:49,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:49,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:49,501 INFO L87 Difference]: Start difference. First operand 362 states and 2050 transitions. Second operand 12 states. [2019-03-04 16:25:49,962 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 28 [2019-03-04 16:25:50,147 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-03-04 16:25:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:51,852 INFO L93 Difference]: Finished difference Result 583 states and 3083 transitions. [2019-03-04 16:25:51,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-03-04 16:25:51,853 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:25:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:51,857 INFO L225 Difference]: With dead ends: 583 [2019-03-04 16:25:51,857 INFO L226 Difference]: Without dead ends: 582 [2019-03-04 16:25:51,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:25:51,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-03-04 16:25:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 469. [2019-03-04 16:25:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-03-04 16:25:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 2692 transitions. [2019-03-04 16:25:52,992 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 2692 transitions. Word has length 7 [2019-03-04 16:25:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:52,992 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 2692 transitions. [2019-03-04 16:25:52,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:25:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 2692 transitions. [2019-03-04 16:25:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:25:52,993 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:52,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:25:52,994 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:52,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:52,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2030973218, now seen corresponding path program 1 times [2019-03-04 16:25:52,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:52,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:52,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:52,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:52,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:53,099 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:53,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:53,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 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:53,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:53,116 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:25:53,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:53,123 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,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,128 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,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,145 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,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,155 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,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,195 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:53,196 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,207 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,219 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,229 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,241 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,276 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:25:53,276 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,283 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,291 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,300 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,322 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:53,322 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-03-04 16:25:53,362 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:25:53,363 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:53,402 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:25:53,402 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:76 [2019-03-04 16:25:53,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, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 43 [2019-03-04 16:25:53,474 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,565 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:25:53,566 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:53,628 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2019-03-04 16:25:53,629 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:87 [2019-03-04 16:25:53,709 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 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:25:53,710 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,800 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 42 treesize of output 58 [2019-03-04 16:25:53,801 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:53,905 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 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:25:53,906 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,964 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2019-03-04 16:25:53,965 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:117, output treesize:125 [2019-03-04 16:25:54,087 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-03-04 16:25:54,131 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 4 new quantified variables, introduced 11 case distinctions, treesize of input 39 treesize of output 55 [2019-03-04 16:25:54,131 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,239 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 4 new quantified variables, introduced 11 case distinctions, treesize of input 39 treesize of output 55 [2019-03-04 16:25:54,240 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,332 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 9 case distinctions, treesize of input 39 treesize of output 44 [2019-03-04 16:25:54,333 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,420 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 9 case distinctions, treesize of input 39 treesize of output 48 [2019-03-04 16:25:54,421 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,473 INFO L309 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-03-04 16:25:54,473 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:157, output treesize:117 [2019-03-04 16:25:55,373 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:55,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:55,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:25:55,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:25:55,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:25:55,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:25:55,402 INFO L87 Difference]: Start difference. First operand 469 states and 2692 transitions. Second operand 12 states. [2019-03-04 16:26:00,501 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-03-04 16:26:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:07,848 INFO L93 Difference]: Finished difference Result 600 states and 3262 transitions. [2019-03-04 16:26:07,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:07,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:26:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:07,855 INFO L225 Difference]: With dead ends: 600 [2019-03-04 16:26:07,855 INFO L226 Difference]: Without dead ends: 599 [2019-03-04 16:26:07,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=55, Invalid=215, Unknown=2, NotChecked=0, Total=272 [2019-03-04 16:26:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-03-04 16:26:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 451. [2019-03-04 16:26:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-03-04 16:26:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 2584 transitions. [2019-03-04 16:26:08,976 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 2584 transitions. Word has length 7 [2019-03-04 16:26:08,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:08,977 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 2584 transitions. [2019-03-04 16:26:08,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 2584 transitions. [2019-03-04 16:26:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:08,978 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:08,978 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:26:08,978 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:08,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:08,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1960362654, now seen corresponding path program 1 times [2019-03-04 16:26:08,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:08,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:08,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:09,008 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:09,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:09,009 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:26:09,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:09,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:26:09,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:09,028 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,051 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:09,075 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:09,112 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:09,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:09,128 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:09,128 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,139 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,148 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,159 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,170 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,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:26:09,191 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,198 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,216 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:09,216 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-03-04 16:26:09,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, 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:09,235 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,240 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,240 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-03-04 16:26:09,260 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:26:09,261 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:09,267 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,267 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-03-04 16:26:09,276 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:09,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:09,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3] total 5 [2019-03-04 16:26:09,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:26:09,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:26:09,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:26:09,297 INFO L87 Difference]: Start difference. First operand 451 states and 2584 transitions. Second operand 7 states. [2019-03-04 16:26:10,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:10,488 INFO L93 Difference]: Finished difference Result 467 states and 2598 transitions. [2019-03-04 16:26:10,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:10,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:26:10,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:10,491 INFO L225 Difference]: With dead ends: 467 [2019-03-04 16:26:10,492 INFO L226 Difference]: Without dead ends: 461 [2019-03-04 16:26:10,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:10,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-03-04 16:26:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 451. [2019-03-04 16:26:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-03-04 16:26:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 2583 transitions. [2019-03-04 16:26:11,625 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 2583 transitions. Word has length 7 [2019-03-04 16:26:11,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:11,625 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 2583 transitions. [2019-03-04 16:26:11,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:26:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 2583 transitions. [2019-03-04 16:26:11,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:11,626 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:11,626 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:26:11,626 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:11,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:11,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1960676068, now seen corresponding path program 2 times [2019-03-04 16:26:11,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:11,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:11,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:11,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:11,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:11,967 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-03-04 16:26:12,103 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:12,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:12,103 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:26:12,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:12,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:12,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:12,125 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:26:12,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:12,155 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:26:12,156 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:12,165 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:12,178 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:12,197 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:12,222 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:26:12,234 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:26:12,240 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:26:12,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:26:12,250 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:12,251 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:12,260 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:12,270 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:12,280 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:12,290 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:12,318 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:12,319 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:26:12,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, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:12,359 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:12,401 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:12,402 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-03-04 16:26:12,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, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 36 treesize of output 59 [2019-03-04 16:26:12,478 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:12,503 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:12,504 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-03-04 16:26:12,539 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:26:12,539 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:12,558 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:12,558 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-03-04 16:26:12,607 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 36 treesize of output 44 [2019-03-04 16:26:12,608 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:12,639 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:26:12,640 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:60 [2019-03-04 16:26:12,778 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:12,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:12,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:26:12,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:26:12,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:26:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:26:12,797 INFO L87 Difference]: Start difference. First operand 451 states and 2583 transitions. Second operand 11 states. [2019-03-04 16:26:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:14,578 INFO L93 Difference]: Finished difference Result 535 states and 2920 transitions. [2019-03-04 16:26:14,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:14,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:26:14,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:14,583 INFO L225 Difference]: With dead ends: 535 [2019-03-04 16:26:14,584 INFO L226 Difference]: Without dead ends: 534 [2019-03-04 16:26:14,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-03-04 16:26:15,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 458. [2019-03-04 16:26:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-03-04 16:26:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 2625 transitions. [2019-03-04 16:26:15,704 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 2625 transitions. Word has length 7 [2019-03-04 16:26:15,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:15,704 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 2625 transitions. [2019-03-04 16:26:15,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:26:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 2625 transitions. [2019-03-04 16:26:15,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:15,706 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:15,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:15,706 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:15,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:15,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-03-04 16:26:15,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:15,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:15,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:15,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:15,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:15,863 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-03-04 16:26:15,890 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:15,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:15,890 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:26:15,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:15,903 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:26:15,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:15,909 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,926 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,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,933 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:26:15,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,942 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,946 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:26:15,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:15,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:15,963 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:15,973 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,984 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,995 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,005 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,039 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:26:16,040 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,046 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,058 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,073 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,101 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:16,101 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:26:16,124 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:16,125 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:16,150 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:16,150 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:26:16,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, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:26:16,197 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:16,240 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:26:16,240 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:80 [2019-03-04 16:26:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:16,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:16,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:16,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:16,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:16,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:16,290 INFO L87 Difference]: Start difference. First operand 458 states and 2625 transitions. Second operand 8 states. [2019-03-04 16:26:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:17,567 INFO L93 Difference]: Finished difference Result 476 states and 2662 transitions. [2019-03-04 16:26:17,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:17,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:26:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:17,573 INFO L225 Difference]: With dead ends: 476 [2019-03-04 16:26:17,573 INFO L226 Difference]: Without dead ends: 475 [2019-03-04 16:26:17,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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:26:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-03-04 16:26:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 461. [2019-03-04 16:26:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-03-04 16:26:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 2643 transitions. [2019-03-04 16:26:18,687 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 2643 transitions. Word has length 7 [2019-03-04 16:26:18,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:18,687 INFO L480 AbstractCegarLoop]: Abstraction has 461 states and 2643 transitions. [2019-03-04 16:26:18,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 2643 transitions. [2019-03-04 16:26:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:18,689 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:18,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:18,689 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:18,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:18,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-03-04 16:26:18,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:18,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:18,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:18,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:18,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:18,771 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:18,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:18,771 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:26:18,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:18,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:26:18,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:19,036 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:26:19,037 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,057 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,068 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,083 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,102 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,127 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:26:19,130 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:26:19,134 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:26:19,137 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:26:19,140 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,141 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,151 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,161 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,171 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,181 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,211 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:19,212 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:26:19,244 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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,244 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,272 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,273 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:26:19,310 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:26:19,311 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,331 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,331 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-03-04 16:26:19,386 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:26:19,387 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,404 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,404 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:36 [2019-03-04 16:26:19,472 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 54 [2019-03-04 16:26:19,473 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:19,493 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,493 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-03-04 16:26:19,517 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:19,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:19,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:26:19,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:26:19,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:26:19,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:19,538 INFO L87 Difference]: Start difference. First operand 461 states and 2643 transitions. Second operand 12 states. [2019-03-04 16:26:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:23,311 INFO L93 Difference]: Finished difference Result 742 states and 4089 transitions. [2019-03-04 16:26:23,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:26:23,311 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:26:23,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:23,317 INFO L225 Difference]: With dead ends: 742 [2019-03-04 16:26:23,317 INFO L226 Difference]: Without dead ends: 741 [2019-03-04 16:26:23,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:26:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-03-04 16:26:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 673. [2019-03-04 16:26:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-03-04 16:26:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 3915 transitions. [2019-03-04 16:26:24,970 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 3915 transitions. Word has length 7 [2019-03-04 16:26:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:24,970 INFO L480 AbstractCegarLoop]: Abstraction has 673 states and 3915 transitions. [2019-03-04 16:26:24,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 3915 transitions. [2019-03-04 16:26:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:24,972 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:24,972 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-03-04 16:26:24,972 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 3 times [2019-03-04 16:26:24,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:24,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:24,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:24,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:24,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:25,047 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:25,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:25,047 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:26:25,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:26:25,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:26:25,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:25,063 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:26:25,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:25,089 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:26:25,090 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,095 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,104 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,121 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,143 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:26:25,155 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:26:25,160 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:26:25,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:26:25,171 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:25,171 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,181 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,191 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,201 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,211 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,239 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:25,240 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:26:25,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, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:26:25,269 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,293 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:25,294 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-03-04 16:26:25,333 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:26:25,334 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:25,368 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:26:25,369 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:76 [2019-03-04 16:26:25,428 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:26:25,428 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,440 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:25,440 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-03-04 16:26:25,480 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 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:26:25,481 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,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:25,490 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-03-04 16:26:25,508 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:25,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:25,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:26:25,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:26:25,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:26:25,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:26:25,527 INFO L87 Difference]: Start difference. First operand 673 states and 3915 transitions. Second operand 11 states. [2019-03-04 16:26:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:28,232 INFO L93 Difference]: Finished difference Result 932 states and 5235 transitions. [2019-03-04 16:26:28,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:28,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:26:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:28,240 INFO L225 Difference]: With dead ends: 932 [2019-03-04 16:26:28,240 INFO L226 Difference]: Without dead ends: 925 [2019-03-04 16:26:28,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-03-04 16:26:30,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 859. [2019-03-04 16:26:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-03-04 16:26:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 5030 transitions. [2019-03-04 16:26:30,329 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 5030 transitions. Word has length 7 [2019-03-04 16:26:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:30,330 INFO L480 AbstractCegarLoop]: Abstraction has 859 states and 5030 transitions. [2019-03-04 16:26:30,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:26:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 5030 transitions. [2019-03-04 16:26:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:30,331 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:30,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:30,332 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-03-04 16:26:30,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:30,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:30,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:30,429 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:30,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:30,429 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:26:30,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:30,443 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:26:30,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:30,448 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:30,460 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:30,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,468 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:26:30,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,480 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:26:30,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,497 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:30,497 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,507 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,517 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,527 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,538 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,573 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:26:30,573 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,579 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,588 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,603 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,631 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:30,631 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:26:30,666 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:30,666 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,684 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:30,685 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-03-04 16:26:30,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, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:26:30,731 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,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:30,749 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-03-04 16:26:30,778 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:30,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:30,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:30,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:30,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:30,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:30,797 INFO L87 Difference]: Start difference. First operand 859 states and 5030 transitions. Second operand 8 states. [2019-03-04 16:26:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:33,084 INFO L93 Difference]: Finished difference Result 873 states and 5043 transitions. [2019-03-04 16:26:33,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:33,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:26:33,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:33,106 INFO L225 Difference]: With dead ends: 873 [2019-03-04 16:26:33,106 INFO L226 Difference]: Without dead ends: 872 [2019-03-04 16:26:33,107 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:26:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-03-04 16:26:35,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 859. [2019-03-04 16:26:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-03-04 16:26:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 5030 transitions. [2019-03-04 16:26:35,250 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 5030 transitions. Word has length 7 [2019-03-04 16:26:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:35,250 INFO L480 AbstractCegarLoop]: Abstraction has 859 states and 5030 transitions. [2019-03-04 16:26:35,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 5030 transitions. [2019-03-04 16:26:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:35,251 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:35,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:35,252 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:35,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-03-04 16:26:35,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:35,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:35,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:35,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:35,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:35,384 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:35,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:35,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 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:26:35,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:35,401 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:26:35,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:35,406 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:35,424 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:35,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:26:35,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,452 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:26:35,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:35,475 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:35,476 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,484 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,496 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,508 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,519 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,556 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:26:35,557 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,563 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,575 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,592 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,621 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:35,621 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:26:35,663 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:26:35,664 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:35,708 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:26:35,709 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-03-04 16:26:35,829 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 62 [2019-03-04 16:26:35,830 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,911 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 5 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:26:35,911 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,953 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:26:35,953 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-03-04 16:26:36,061 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 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-03-04 16:26:36,062 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:36,151 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:26:36,152 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:36,191 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:26:36,192 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:74 [2019-03-04 16:26:36,245 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:36,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:36,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-03-04 16:26:36,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:26:36,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:26:36,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:26:36,264 INFO L87 Difference]: Start difference. First operand 859 states and 5030 transitions. Second operand 11 states. [2019-03-04 16:26:37,840 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-03-04 16:26:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:39,802 INFO L93 Difference]: Finished difference Result 1075 states and 6065 transitions. [2019-03-04 16:26:39,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:26:39,803 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:26:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:39,809 INFO L225 Difference]: With dead ends: 1075 [2019-03-04 16:26:39,809 INFO L226 Difference]: Without dead ends: 1074 [2019-03-04 16:26:39,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:26:39,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-03-04 16:26:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 917. [2019-03-04 16:26:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2019-03-04 16:26:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 5378 transitions. [2019-03-04 16:26:42,130 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 5378 transitions. Word has length 7 [2019-03-04 16:26:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:42,130 INFO L480 AbstractCegarLoop]: Abstraction has 917 states and 5378 transitions. [2019-03-04 16:26:42,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:26:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 5378 transitions. [2019-03-04 16:26:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:42,133 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:42,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:42,133 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:42,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:42,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1937552180, now seen corresponding path program 1 times [2019-03-04 16:26:42,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:42,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:42,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:26:42,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:26:42,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:26:42,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:26:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:26:42,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:26:42,313 INFO L87 Difference]: Start difference. First operand 917 states and 5378 transitions. Second operand 4 states. [2019-03-04 16:26:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:44,507 INFO L93 Difference]: Finished difference Result 930 states and 5390 transitions. [2019-03-04 16:26:44,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:26:44,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-03-04 16:26:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:44,511 INFO L225 Difference]: With dead ends: 930 [2019-03-04 16:26:44,512 INFO L226 Difference]: Without dead ends: 921 [2019-03-04 16:26:44,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:26:44,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-03-04 16:26:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 917. [2019-03-04 16:26:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2019-03-04 16:26:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 5363 transitions. [2019-03-04 16:26:46,768 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 5363 transitions. Word has length 7 [2019-03-04 16:26:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:46,768 INFO L480 AbstractCegarLoop]: Abstraction has 917 states and 5363 transitions. [2019-03-04 16:26:46,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:26:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 5363 transitions. [2019-03-04 16:26:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:46,770 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:46,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:46,770 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:46,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:46,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-03-04 16:26:46,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:46,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:46,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:46,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:46,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:46,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:46,962 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:26:46,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:46,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:46,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:46,976 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:26:46,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:46,999 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:26:46,999 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,001 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,006 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,019 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,036 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,057 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:26:47,060 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:26:47,063 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:26:47,066 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:26:47,068 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:47,069 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,077 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,087 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,096 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,105 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,134 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:47,134 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:26:47,162 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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:47,162 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,189 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:47,189 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:26:47,225 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:26:47,225 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,245 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:47,245 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:40 [2019-03-04 16:26:47,291 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:26:47,291 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,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:26:47,307 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-03-04 16:26:47,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, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:26:47,368 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:47,382 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:47,383 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-03-04 16:26:47,406 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:47,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:47,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:26:47,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:26:47,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:26:47,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:26:47,426 INFO L87 Difference]: Start difference. First operand 917 states and 5363 transitions. Second operand 12 states. [2019-03-04 16:26:50,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:50,996 INFO L93 Difference]: Finished difference Result 1293 states and 7399 transitions. [2019-03-04 16:26:50,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:26:50,997 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:26:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:51,001 INFO L225 Difference]: With dead ends: 1293 [2019-03-04 16:26:51,001 INFO L226 Difference]: Without dead ends: 1290 [2019-03-04 16:26:51,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:26:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-03-04 16:26:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 996. [2019-03-04 16:26:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-03-04 16:26:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 5839 transitions. [2019-03-04 16:26:53,504 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 5839 transitions. Word has length 7 [2019-03-04 16:26:53,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:53,504 INFO L480 AbstractCegarLoop]: Abstraction has 996 states and 5839 transitions. [2019-03-04 16:26:53,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:26:53,504 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 5839 transitions. [2019-03-04 16:26:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:53,506 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:53,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:53,506 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:53,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:53,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1924561318, now seen corresponding path program 1 times [2019-03-04 16:26:53,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:53,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:53,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:53,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:53,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:26:53,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:26:53,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:26:53,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:26:53,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:26:53,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:26:53,593 INFO L87 Difference]: Start difference. First operand 996 states and 5839 transitions. Second operand 5 states. [2019-03-04 16:26:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:55,991 INFO L93 Difference]: Finished difference Result 1014 states and 5900 transitions. [2019-03-04 16:26:55,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:26:55,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-03-04 16:26:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:55,997 INFO L225 Difference]: With dead ends: 1014 [2019-03-04 16:26:55,997 INFO L226 Difference]: Without dead ends: 1010 [2019-03-04 16:26:55,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:26:55,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-03-04 16:26:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1005. [2019-03-04 16:26:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-03-04 16:26:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 5890 transitions. [2019-03-04 16:26:58,589 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 5890 transitions. Word has length 7 [2019-03-04 16:26:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:58,589 INFO L480 AbstractCegarLoop]: Abstraction has 1005 states and 5890 transitions. [2019-03-04 16:26:58,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:26:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 5890 transitions. [2019-03-04 16:26:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:26:58,591 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:58,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:26:58,591 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:58,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:58,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-03-04 16:26:58,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:58,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:58,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:58,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:58,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:58,702 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,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:58,702 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:26:58,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:58,718 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:26:58,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:58,725 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,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, 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,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,758 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:26:58,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,768 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:26:58,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,785 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:26:58,785 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,794 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,804 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,814 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,824 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,857 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:26:58,858 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,865 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,877 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,893 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,919 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:58,920 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:26:58,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, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:26:58,953 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:58,994 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:26:58,995 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-03-04 16:26:59,037 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,038 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,056 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,057 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-03-04 16:26:59,074 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:59,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:59,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 7 [2019-03-04 16:26:59,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:26:59,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:26:59,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:59,093 INFO L87 Difference]: Start difference. First operand 1005 states and 5890 transitions. Second operand 9 states. [2019-03-04 16:27:01,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:01,789 INFO L93 Difference]: Finished difference Result 1016 states and 5920 transitions. [2019-03-04 16:27:01,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:27:01,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:27:01,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:01,794 INFO L225 Difference]: With dead ends: 1016 [2019-03-04 16:27:01,794 INFO L226 Difference]: Without dead ends: 1009 [2019-03-04 16:27:01,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2019-03-04 16:27:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2019-03-04 16:27:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-03-04 16:27:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 5910 transitions. [2019-03-04 16:27:04,384 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 5910 transitions. Word has length 7 [2019-03-04 16:27:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:04,384 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 5910 transitions. [2019-03-04 16:27:04,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:27:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 5910 transitions. [2019-03-04 16:27:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:27:04,386 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:04,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:04,386 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:04,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:04,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-03-04 16:27:04,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:04,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:04,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:04,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:04,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:04,442 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:04,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:04,443 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:27:04,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:04,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:04,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:04,456 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:27:04,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:04,483 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:27:04,483 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,489 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,502 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,517 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,539 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:27:04,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, 6 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:04,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:27:04,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:27:04,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:04,604 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,613 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,623 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,632 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,642 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,668 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:04,668 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:27:04,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 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:27:04,713 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,729 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:04,729 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:27:04,760 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 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:27:04,760 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,772 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:04,772 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:27:04,814 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 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:27:04,814 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:04,827 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:04,827 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:27:04,844 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:04,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:04,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:27:04,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:27:04,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:27:04,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:27:04,864 INFO L87 Difference]: Start difference. First operand 1009 states and 5910 transitions. Second operand 9 states. [2019-03-04 16:27:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:07,789 INFO L93 Difference]: Finished difference Result 1078 states and 6208 transitions. [2019-03-04 16:27:07,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:27:07,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:27:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:07,793 INFO L225 Difference]: With dead ends: 1078 [2019-03-04 16:27:07,793 INFO L226 Difference]: Without dead ends: 1073 [2019-03-04 16:27:07,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 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:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2019-03-04 16:27:10,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1054. [2019-03-04 16:27:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-03-04 16:27:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6179 transitions. [2019-03-04 16:27:10,539 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6179 transitions. Word has length 7 [2019-03-04 16:27:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:10,539 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6179 transitions. [2019-03-04 16:27:10,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:27:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6179 transitions. [2019-03-04 16:27:10,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:27:10,540 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:10,541 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:10,541 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:10,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:10,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-03-04 16:27:10,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:10,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:10,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:10,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:10,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:10,611 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:10,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:10,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 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:27:10,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:27:10,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:27:10,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:10,625 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:27:10,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:10,635 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,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,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, 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,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,655 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,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,666 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,670 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,673 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 L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:10,681 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,682 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,695 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,704 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,715 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,725 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,765 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:27:10,766 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,768 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,774 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,784 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,801 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,830 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:10,830 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:27:10,862 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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,863 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,890 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,890 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:27:10,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, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:27:10,927 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,948 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,948 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:27:10,995 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:27:10,995 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,012 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:11,012 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-03-04 16:27:11,074 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 54 [2019-03-04 16:27:11,075 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,091 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:11,091 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-03-04 16:27:11,118 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:11,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:11,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:27:11,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:27:11,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:27:11,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:27:11,136 INFO L87 Difference]: Start difference. First operand 1054 states and 6179 transitions. Second operand 11 states. [2019-03-04 16:27:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:16,054 INFO L93 Difference]: Finished difference Result 1777 states and 10341 transitions. [2019-03-04 16:27:16,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:27:16,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:27:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:16,061 INFO L225 Difference]: With dead ends: 1777 [2019-03-04 16:27:16,061 INFO L226 Difference]: Without dead ends: 1776 [2019-03-04 16:27:16,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:27:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2019-03-04 16:27:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1004. [2019-03-04 16:27:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-03-04 16:27:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 5880 transitions. [2019-03-04 16:27:18,750 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 5880 transitions. Word has length 7 [2019-03-04 16:27:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:18,751 INFO L480 AbstractCegarLoop]: Abstraction has 1004 states and 5880 transitions. [2019-03-04 16:27:18,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:27:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 5880 transitions. [2019-03-04 16:27:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:27:18,753 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:18,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:18,753 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:18,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:18,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2042772006, now seen corresponding path program 1 times [2019-03-04 16:27:18,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:18,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:18,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:18,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:18,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:18,836 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:27:18,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:18,836 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:27:18,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:18,851 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:27:18,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:18,880 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:27:18,880 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,885 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,894 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,910 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,932 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:27:18,943 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:27:18,947 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:27:18,951 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:27:18,956 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:18,956 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,966 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,975 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,984 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,032 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,059 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:19,059 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:27:19,092 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:27:19,093 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:27:19,140 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:27:19,140 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 16:27:19,179 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:19,180 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,200 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,201 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:27 [2019-03-04 16:27:19,217 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:27:19,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:19,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:19,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:19,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:19,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:19,236 INFO L87 Difference]: Start difference. First operand 1004 states and 5880 transitions. Second operand 8 states. [2019-03-04 16:27:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:22,088 INFO L93 Difference]: Finished difference Result 1036 states and 5981 transitions. [2019-03-04 16:27:22,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:27:22,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:27:22,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:22,097 INFO L225 Difference]: With dead ends: 1036 [2019-03-04 16:27:22,097 INFO L226 Difference]: Without dead ends: 1035 [2019-03-04 16:27:22,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-03-04 16:27:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1010. [2019-03-04 16:27:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2019-03-04 16:27:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 5916 transitions. [2019-03-04 16:27:24,728 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 5916 transitions. Word has length 7 [2019-03-04 16:27:24,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:24,729 INFO L480 AbstractCegarLoop]: Abstraction has 1010 states and 5916 transitions. [2019-03-04 16:27:24,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 5916 transitions. [2019-03-04 16:27:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:27:24,730 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:24,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:24,731 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:24,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:24,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-03-04 16:27:24,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:24,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:24,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:24,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:24,871 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-03-04 16:27:24,892 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:27:24,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:24,892 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:27:24,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:24,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:24,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:24,907 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:27:24,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:24,932 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:27:24,932 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:24,941 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,954 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,974 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,997 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:27:25,008 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:27:25,013 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:27:25,018 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:27:25,024 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:25,024 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,032 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,041 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,051 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,059 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,086 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:25,086 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:27:25,122 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:25,122 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:25,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:27:25,147 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:27:25,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:27:25,192 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:27:25,233 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:27:25,233 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:80 [2019-03-04 16:27:25,278 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:27:25,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:25,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:25,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:25,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:25,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:25,296 INFO L87 Difference]: Start difference. First operand 1010 states and 5916 transitions. Second operand 8 states. [2019-03-04 16:27:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:27,922 INFO L93 Difference]: Finished difference Result 1019 states and 5934 transitions. [2019-03-04 16:27:27,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:27:27,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:27:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:27,925 INFO L225 Difference]: With dead ends: 1019 [2019-03-04 16:27:27,925 INFO L226 Difference]: Without dead ends: 1012 [2019-03-04 16:27:27,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-03-04 16:27:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1008. [2019-03-04 16:27:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2019-03-04 16:27:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 5904 transitions. [2019-03-04 16:27:30,536 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 5904 transitions. Word has length 7 [2019-03-04 16:27:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:30,536 INFO L480 AbstractCegarLoop]: Abstraction has 1008 states and 5904 transitions. [2019-03-04 16:27:30,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:30,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 5904 transitions. [2019-03-04 16:27:30,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:27:30,538 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:30,538 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:30,538 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:30,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:30,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1874504214, now seen corresponding path program 1 times [2019-03-04 16:27:30,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:30,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:30,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:30,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:30,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:30,603 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:30,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:30,603 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:27:30,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:30,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:27:30,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:30,629 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:27:30,630 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,638 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,651 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:27:30,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, 2 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:30,688 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:27:30,722 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:27:30,730 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:30,730 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,739 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,748 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,758 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,767 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,783 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:30,783 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-03-04 16:27:30,806 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:27:30,806 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,819 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,819 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2019-03-04 16:27:30,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 21 [2019-03-04 16:27:30,859 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,864 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,864 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:13 [2019-03-04 16:27:30,885 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:27:30,885 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:30,891 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,891 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-03-04 16:27:30,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:27:30,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:30,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:27:30,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:27:30,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:27:30,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:27:30,922 INFO L87 Difference]: Start difference. First operand 1008 states and 5904 transitions. Second operand 9 states. [2019-03-04 16:27:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:33,628 INFO L93 Difference]: Finished difference Result 1029 states and 5933 transitions. [2019-03-04 16:27:33,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:27:33,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:27:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:33,631 INFO L225 Difference]: With dead ends: 1029 [2019-03-04 16:27:33,631 INFO L226 Difference]: Without dead ends: 1023 [2019-03-04 16:27:33,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:33,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-03-04 16:27:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1009. [2019-03-04 16:27:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-03-04 16:27:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 5909 transitions. [2019-03-04 16:27:36,268 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 5909 transitions. Word has length 8 [2019-03-04 16:27:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:36,268 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 5909 transitions. [2019-03-04 16:27:36,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:27:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 5909 transitions. [2019-03-04 16:27:36,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:27:36,270 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:36,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:36,270 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:36,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:36,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-03-04 16:27:36,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:36,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:36,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:36,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:36,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:36,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:27:36,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:36,369 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:27:36,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:36,382 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:27:36,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:36,430 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:27:36,431 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,435 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,445 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,464 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,488 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:27:36,501 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:27:36,506 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:27:36,510 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:27:36,516 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:27:36,516 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,525 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,535 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,544 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,553 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,580 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:36,580 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:27:36,607 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:27:36,607 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,633 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,633 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:48 [2019-03-04 16:27:36,801 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:27:36,801 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:36,820 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,821 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-03-04 16:27:36,912 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 50 [2019-03-04 16:27:36,913 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:27:36,946 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:27:36,946 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:68 [2019-03-04 16:27:36,983 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:37,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:37,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-03-04 16:27:37,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:27:37,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:27:37,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:27:37,003 INFO L87 Difference]: Start difference. First operand 1009 states and 5909 transitions. Second operand 11 states. [2019-03-04 16:27:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:41,763 INFO L93 Difference]: Finished difference Result 1806 states and 10380 transitions. [2019-03-04 16:27:41,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:27:41,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:27:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:41,768 INFO L225 Difference]: With dead ends: 1806 [2019-03-04 16:27:41,768 INFO L226 Difference]: Without dead ends: 1805 [2019-03-04 16:27:41,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:27:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2019-03-04 16:27:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1350. [2019-03-04 16:27:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2019-03-04 16:27:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 7952 transitions. [2019-03-04 16:27:45,352 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 7952 transitions. Word has length 8 [2019-03-04 16:27:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:45,352 INFO L480 AbstractCegarLoop]: Abstraction has 1350 states and 7952 transitions. [2019-03-04 16:27:45,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:27:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 7952 transitions. [2019-03-04 16:27:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:27:45,354 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:45,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:45,355 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:45,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:45,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-03-04 16:27:45,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:45,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:45,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:45,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:45,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:45,474 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:45,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:45,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 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:27:45,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:45,488 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:27:45,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:45,492 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:45,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,496 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:45,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,503 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:45,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,515 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:45,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:45,530 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:45,531 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,619 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,630 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,639 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,649 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,688 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:27:45,689 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,691 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,699 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,711 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,728 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,757 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,757 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-03-04 16:27:45,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 36 treesize of output 31 [2019-03-04 16:27:45,792 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,820 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:45,820 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:27:45,861 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:27:45,862 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,881 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:45,882 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:27:45,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, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:27:45,931 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:45,946 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:45,947 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-03-04 16:27:46,012 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 54 [2019-03-04 16:27:46,012 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,028 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:46,029 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:38 [2019-03-04 16:27:46,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, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 40 treesize of output 59 [2019-03-04 16:27:46,102 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:46,118 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:46,118 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-03-04 16:27:48,151 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:48,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:48,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:27:48,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:27:48,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:27:48,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=123, Unknown=1, NotChecked=0, Total=182 [2019-03-04 16:27:48,172 INFO L87 Difference]: Start difference. First operand 1350 states and 7952 transitions. Second operand 14 states. [2019-03-04 16:27:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:53,450 INFO L93 Difference]: Finished difference Result 1641 states and 9468 transitions. [2019-03-04 16:27:53,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:27:53,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-03-04 16:27:53,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:53,455 INFO L225 Difference]: With dead ends: 1641 [2019-03-04 16:27:53,455 INFO L226 Difference]: Without dead ends: 1640 [2019-03-04 16:27:53,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=97, Invalid=244, Unknown=1, NotChecked=0, Total=342 [2019-03-04 16:27:53,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2019-03-04 16:27:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1332. [2019-03-04 16:27:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1332 states. [2019-03-04 16:27:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 7844 transitions. [2019-03-04 16:27:57,025 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 7844 transitions. Word has length 8 [2019-03-04 16:27:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:57,025 INFO L480 AbstractCegarLoop]: Abstraction has 1332 states and 7844 transitions. [2019-03-04 16:27:57,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:27:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 7844 transitions. [2019-03-04 16:27:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:27:57,027 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:57,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:27:57,027 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:57,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-03-04 16:27:57,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:57,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:57,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:57,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:27:57,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:27:57,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:27:57,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:27:57,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:27:57,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:27:57,118 INFO L87 Difference]: Start difference. First operand 1332 states and 7844 transitions. Second operand 5 states. [2019-03-04 16:28:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:00,471 INFO L93 Difference]: Finished difference Result 1352 states and 7863 transitions. [2019-03-04 16:28:00,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:28:00,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-03-04 16:28:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:00,475 INFO L225 Difference]: With dead ends: 1352 [2019-03-04 16:28:00,475 INFO L226 Difference]: Without dead ends: 1343 [2019-03-04 16:28:00,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:28:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-03-04 16:28:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1332. [2019-03-04 16:28:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1332 states. [2019-03-04 16:28:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 7775 transitions. [2019-03-04 16:28:04,055 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 7775 transitions. Word has length 8 [2019-03-04 16:28:04,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:04,055 INFO L480 AbstractCegarLoop]: Abstraction has 1332 states and 7775 transitions. [2019-03-04 16:28:04,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:28:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 7775 transitions. [2019-03-04 16:28:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:28:04,058 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:04,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:04,059 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:04,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-03-04 16:28:04,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:04,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:04,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:04,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:04,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:04,223 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:28:04,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:04,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 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:28:04,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:28:04,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:28:04,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:04,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:28:04,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:04,252 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:28:04,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,256 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:28:04,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,263 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:28:04,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,273 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:28:04,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:04,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, 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:28:04,289 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,300 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,310 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,321 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,330 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,370 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:28:04,371 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,375 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,385 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,401 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,417 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,446 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,446 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-03-04 16:28:04,481 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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:28:04,481 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,520 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:28:04,521 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:52 [2019-03-04 16:28:04,560 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:28:04,560 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,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:28:04,582 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:28:04,631 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:28:04,632 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,647 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:28:04,647 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-03-04 16:28:04,712 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 52 [2019-03-04 16:28:04,712 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,726 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:28:04,726 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:28:04,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, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 40 treesize of output 55 [2019-03-04 16:28:04,798 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:04,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:28:04,813 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-03-04 16:28:06,507 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:28:06,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:06,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:28:06,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:28:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:28:06,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:28:06,526 INFO L87 Difference]: Start difference. First operand 1332 states and 7775 transitions. Second operand 14 states. [2019-03-04 16:28:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:10,703 INFO L93 Difference]: Finished difference Result 1351 states and 7791 transitions. [2019-03-04 16:28:10,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:28:10,703 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-03-04 16:28:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:10,706 INFO L225 Difference]: With dead ends: 1351 [2019-03-04 16:28:10,706 INFO L226 Difference]: Without dead ends: 1345 [2019-03-04 16:28:10,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:28:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2019-03-04 16:28:11,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 164. [2019-03-04 16:28:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-03-04 16:28:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 850 transitions. [2019-03-04 16:28:11,318 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 850 transitions. Word has length 8 [2019-03-04 16:28:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:11,319 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 850 transitions. [2019-03-04 16:28:11,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:28:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 850 transitions. [2019-03-04 16:28:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:28:11,320 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:11,320 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:11,320 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:11,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:11,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-03-04 16:28:11,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:11,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:11,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:11,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:11,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:11,403 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:28:11,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:11,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 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:28:11,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:11,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:28:11,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:11,441 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:28:11,441 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,447 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,454 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,468 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:28:11,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:28:11,483 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:28:11,488 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:28:11,519 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:28:11,520 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,529 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,538 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,547 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,557 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,575 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:11,575 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:28:11,605 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:28:11,605 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,615 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,615 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:22 [2019-03-04 16:28:11,656 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:28:11,657 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,665 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,665 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-03-04 16:28: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, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 33 [2019-03-04 16:28:11,697 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,704 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:28:11,704 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-03-04 16:28:11,740 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 37 [2019-03-04 16:28:11,741 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:11,749 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:28:11,749 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-03-04 16:28:11,765 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:28:11,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:11,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:28:11,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:28:11,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:28:11,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:28:11,793 INFO L87 Difference]: Start difference. First operand 164 states and 850 transitions. Second operand 11 states. [2019-03-04 16:28:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:13,138 INFO L93 Difference]: Finished difference Result 172 states and 871 transitions. [2019-03-04 16:28:13,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:28:13,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:28:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:13,139 INFO L225 Difference]: With dead ends: 172 [2019-03-04 16:28:13,139 INFO L226 Difference]: Without dead ends: 171 [2019-03-04 16:28:13,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:28:13,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-03-04 16:28:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 58. [2019-03-04 16:28:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-03-04 16:28:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 252 transitions. [2019-03-04 16:28:13,400 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 252 transitions. Word has length 8 [2019-03-04 16:28:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:13,400 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 252 transitions. [2019-03-04 16:28:13,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:28:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 252 transitions. [2019-03-04 16:28:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:28:13,401 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:13,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:13,401 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:13,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:13,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-03-04 16:28:13,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:13,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:13,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:13,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:13,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:13,466 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:28:13,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:13,466 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:28:13,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:13,480 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:28:13,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:13,487 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:28:13,499 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:28:13,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,506 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:28:13,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,520 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:28:13,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:13,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:28:13,536 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:13,545 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:13,554 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:13,565 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:13,575 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:13,610 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:28:13,611 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:13,616 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:13,625 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:13,640 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:13,667 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:13,667 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:28:13,701 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:28:13,702 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:13,718 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:28:13,718 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:28:13,745 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 5 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:28:13,745 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:13,759 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:28:13,759 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:28:13,800 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 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:28:13,801 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:13,812 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:28:13,812 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:28:13,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:28:13,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:13,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:28:13,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:28:13,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:28:13,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:28:13,847 INFO L87 Difference]: Start difference. First operand 58 states and 252 transitions. Second operand 9 states. [2019-03-04 16:28:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:14,554 INFO L93 Difference]: Finished difference Result 89 states and 356 transitions. [2019-03-04 16:28:14,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:28:14,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:28:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:14,556 INFO L225 Difference]: With dead ends: 89 [2019-03-04 16:28:14,556 INFO L226 Difference]: Without dead ends: 82 [2019-03-04 16:28:14,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:28:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-03-04 16:28:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2019-03-04 16:28:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-03-04 16:28:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 329 transitions. [2019-03-04 16:28:14,969 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 329 transitions. Word has length 8 [2019-03-04 16:28:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:14,969 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 329 transitions. [2019-03-04 16:28:14,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:28:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 329 transitions. [2019-03-04 16:28:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:28:14,969 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:14,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:14,970 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:14,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:14,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-03-04 16:28:14,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:14,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:14,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:14,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:14,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:15,081 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:28:15,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:15,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 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:28:15,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:15,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:28:15,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:15,109 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-03-04 16:28:15,110 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:15,122 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:15,133 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:15,149 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:28:15,163 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:28:15,168 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:28:15,173 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:28:15,204 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:28:15,204 INFO L309 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:15,214 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:15,223 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:15,232 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:15,242 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:15,259 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:15,259 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-03-04 16:28:15,288 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:28:15,289 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:15,298 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:15,298 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:22 [2019-03-04 16:28:15,320 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-03-04 16:28:15,321 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:15,329 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:28:15,330 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-03-04 16:28:15,365 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 37 [2019-03-04 16:28:15,365 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:15,374 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:28:15,374 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-03-04 16:28:15,390 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:28:15,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:15,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:28:15,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:28:15,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:28:15,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:28:15,408 INFO L87 Difference]: Start difference. First operand 72 states and 329 transitions. Second operand 10 states. [2019-03-04 16:28:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:16,787 INFO L93 Difference]: Finished difference Result 137 states and 572 transitions. [2019-03-04 16:28:16,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:28:16,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:28:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:16,788 INFO L225 Difference]: With dead ends: 137 [2019-03-04 16:28:16,788 INFO L226 Difference]: Without dead ends: 127 [2019-03-04 16:28:16,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 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:28:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-03-04 16:28:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 81. [2019-03-04 16:28:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-03-04 16:28:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 377 transitions. [2019-03-04 16:28:17,525 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 377 transitions. Word has length 8 [2019-03-04 16:28:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:17,525 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 377 transitions. [2019-03-04 16:28:17,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:28:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 377 transitions. [2019-03-04 16:28:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:28:17,525 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:17,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:17,526 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:17,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:17,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-03-04 16:28:17,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:17,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:17,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:17,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:17,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:17,687 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:28:17,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:17,687 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:28:17,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:28:17,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:28:17,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:17,702 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:28:17,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:17,708 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:28:17,719 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:28:17,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,726 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:28:17,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,737 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:28:17,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:17,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:28:17,754 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,762 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,773 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,782 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,793 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,827 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:28:17,828 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,832 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,841 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,856 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,882 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:17,883 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:28:17,905 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:28:17,905 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:17,930 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:28:17,930 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:28:17,973 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:28:17,974 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:28:18,014 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:28:18,015 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:80 [2019-03-04 16:28:18,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, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 29 [2019-03-04 16:28:18,070 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:18,084 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:28:18,084 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:27 [2019-03-04 16:28:18,100 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:28:18,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:18,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:28:18,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:28:18,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:28:18,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:28:18,119 INFO L87 Difference]: Start difference. First operand 81 states and 377 transitions. Second operand 10 states. [2019-03-04 16:28:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:19,295 INFO L93 Difference]: Finished difference Result 110 states and 479 transitions. [2019-03-04 16:28:19,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:28:19,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:28:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:19,296 INFO L225 Difference]: With dead ends: 110 [2019-03-04 16:28:19,296 INFO L226 Difference]: Without dead ends: 103 [2019-03-04 16:28:19,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:28:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-03-04 16:28:20,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 88. [2019-03-04 16:28:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-03-04 16:28:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 413 transitions. [2019-03-04 16:28:20,050 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 413 transitions. Word has length 8 [2019-03-04 16:28:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:20,050 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 413 transitions. [2019-03-04 16:28:20,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:28:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 413 transitions. [2019-03-04 16:28:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:28:20,050 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:20,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:20,051 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:20,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:20,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-03-04 16:28:20,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:20,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:20,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:20,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:20,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:20,146 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:28:20,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:20,146 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:28:20,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:20,160 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:28:20,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:20,164 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:28:20,181 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:28:20,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:28:20,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,202 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:28:20,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:20,219 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:28:20,219 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:20,229 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:20,240 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:20,250 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:20,260 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:20,295 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:28:20,295 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:20,302 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:20,316 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:20,332 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:20,358 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:20,358 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:28:20,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, 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:28:20,402 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:20,418 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:28:20,418 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 16:28:20,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, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:28:20,452 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:20,464 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:28:20,464 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-03-04 16:28:20,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, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 40 [2019-03-04 16:28:20,508 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:20,521 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:28:20,521 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-03-04 16:28:20,540 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:28:20,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:20,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:28:20,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:28:20,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:28:20,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:28:20,558 INFO L87 Difference]: Start difference. First operand 88 states and 413 transitions. Second operand 10 states. [2019-03-04 16:28:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:21,679 INFO L93 Difference]: Finished difference Result 97 states and 431 transitions. [2019-03-04 16:28:21,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:28:21,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:28:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:21,681 INFO L225 Difference]: With dead ends: 97 [2019-03-04 16:28:21,681 INFO L226 Difference]: Without dead ends: 90 [2019-03-04 16:28:21,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:28:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-03-04 16:28:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-03-04 16:28:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-03-04 16:28:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 408 transitions. [2019-03-04 16:28:22,419 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 408 transitions. Word has length 8 [2019-03-04 16:28:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:22,420 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 408 transitions. [2019-03-04 16:28:22,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:28:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 408 transitions. [2019-03-04 16:28:22,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:28:22,420 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:22,420 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:22,420 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:22,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:22,421 INFO L82 PathProgramCache]: Analyzing trace with hash -931747230, now seen corresponding path program 1 times [2019-03-04 16:28:22,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:22,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:22,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:22,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:22,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:22,485 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:28:22,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:22,486 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:28:22,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:22,500 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:28:22,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:22,533 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:28:22,533 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:22,542 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:22,554 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:22,568 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:22,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:28:22,600 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:28:22,605 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:28:22,611 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:28:22,615 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:28:22,616 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:22,625 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:22,635 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:22,644 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:22,653 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:22,680 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:22,680 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:28:22,706 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:28:22,707 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:22,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:28:22,730 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-03-04 16:28:22,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, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:28:22,773 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:28:22,808 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:28:22,808 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:76 [2019-03-04 16:28:22,865 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 45 [2019-03-04 16:28:22,866 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:22,881 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:28:22,881 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:28:22,904 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:28:22,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:22,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:28:22,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:28:22,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:28:22,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:28:22,923 INFO L87 Difference]: Start difference. First operand 87 states and 408 transitions. Second operand 9 states. [2019-03-04 16:28:24,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:24,040 INFO L93 Difference]: Finished difference Result 105 states and 445 transitions. [2019-03-04 16:28:24,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:28:24,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:28:24,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:24,041 INFO L225 Difference]: With dead ends: 105 [2019-03-04 16:28:24,041 INFO L226 Difference]: Without dead ends: 104 [2019-03-04 16:28:24,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:28:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-03-04 16:28:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 90. [2019-03-04 16:28:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-03-04 16:28:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 426 transitions. [2019-03-04 16:28:24,872 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 426 transitions. Word has length 8 [2019-03-04 16:28:24,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:24,873 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 426 transitions. [2019-03-04 16:28:24,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:28:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 426 transitions. [2019-03-04 16:28:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:28:24,873 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:24,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:24,873 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:24,874 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-03-04 16:28:24,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:24,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:24,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:24,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:24,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:28:24,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:24,982 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:28:24,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:24,997 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:28:24,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:25,029 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:28:25,029 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:25,036 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:25,046 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:25,062 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:25,084 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:28:25,095 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 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:28:25,101 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:28:25,106 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:28:25,111 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:28:25,112 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:25,121 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:25,130 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:25,140 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:25,149 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:25,176 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:25,176 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:28:25,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, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:28:25,210 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:25,235 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:28:25,235 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-03-04 16:28:25,281 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 41 [2019-03-04 16:28:25,282 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:28:25,316 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:28:25,316 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:76 [2019-03-04 16:28:25,414 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 50 [2019-03-04 16:28:25,414 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:25,481 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:28:25,482 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:25,513 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:28:25,513 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-03-04 16:28:25,568 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:28:25,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:25,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2019-03-04 16:28:25,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:28:25,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:28:25,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:28:25,587 INFO L87 Difference]: Start difference. First operand 90 states and 426 transitions. Second operand 11 states. [2019-03-04 16:28:26,048 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-03-04 16:28:27,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:27,412 INFO L93 Difference]: Finished difference Result 131 states and 552 transitions. [2019-03-04 16:28:27,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:28:27,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:28:27,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:27,414 INFO L225 Difference]: With dead ends: 131 [2019-03-04 16:28:27,414 INFO L226 Difference]: Without dead ends: 127 [2019-03-04 16:28:27,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:28:27,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-03-04 16:28:28,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-03-04 16:28:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-03-04 16:28:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 394 transitions. [2019-03-04 16:28:28,216 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 394 transitions. Word has length 8 [2019-03-04 16:28:28,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:28,216 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 394 transitions. [2019-03-04 16:28:28,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:28:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 394 transitions. [2019-03-04 16:28:28,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:28:28,217 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:28,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:28,218 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:28,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:28,218 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-03-04 16:28:28,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:28,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:28,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:28,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:28,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:28,300 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:28:28,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:28,300 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:28:28,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:28,315 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:28:28,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:28,346 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:28:28,346 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:28,352 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:28,362 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:28,383 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:28,407 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:28:28,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, 6 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:28:28,423 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:28:28,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:28:28,432 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:28:28,432 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:28,442 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:28,452 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:28,472 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:28,482 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:28,508 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:28,509 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:28:28,552 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:28:28,553 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:28,571 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:28:28,571 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 16:28:28,603 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:28:28,604 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:28,618 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:28:28,618 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-03-04 16:28:28,660 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 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:28:28,661 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:28,671 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:28:28,671 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-03-04 16:28:28,688 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:28:28,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:28,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-03-04 16:28:28,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:28:28,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:28:28,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:28:28,707 INFO L87 Difference]: Start difference. First operand 84 states and 394 transitions. Second operand 9 states. [2019-03-04 16:28:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:29,965 INFO L93 Difference]: Finished difference Result 102 states and 440 transitions. [2019-03-04 16:28:29,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:28:29,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:28:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:29,966 INFO L225 Difference]: With dead ends: 102 [2019-03-04 16:28:29,966 INFO L226 Difference]: Without dead ends: 98 [2019-03-04 16:28:29,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:28:29,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-03-04 16:28:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2019-03-04 16:28:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-03-04 16:28:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 428 transitions. [2019-03-04 16:28:30,896 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 428 transitions. Word has length 8 [2019-03-04 16:28:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:30,897 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 428 transitions. [2019-03-04 16:28:30,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:28:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 428 transitions. [2019-03-04 16:28:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:28:30,897 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:30,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:30,897 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1336907178, now seen corresponding path program 1 times [2019-03-04 16:28:30,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:30,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:30,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:30,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:30,990 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:28:30,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:30,991 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:28:30,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:31,004 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:28:31,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:31,038 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:28:31,038 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:31,048 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:31,061 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:31,081 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:31,105 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:28:31,117 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:28:31,121 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:28:31,125 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:28:31,129 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:28:31,130 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:31,139 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:31,148 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:31,157 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:31,167 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:31,193 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:31,193 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:28:31,232 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:28:31,232 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:28:31,276 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:28:31,276 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:100 [2019-03-04 16:28:31,379 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-03-04 16:28:31,380 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:31,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, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:28:31,456 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:31,494 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:28:31,494 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-03-04 16:28:31,557 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 55 treesize of output 50 [2019-03-04 16:28:31,557 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:31,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, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 59 [2019-03-04 16:28:31,626 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:31,660 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:28:31,661 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:106, output treesize:70 [2019-03-04 16:28:35,720 WARN L181 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 49 [2019-03-04 16:28:35,724 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:28:35,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:35,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:28:35,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:28:35,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:28:35,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:28:35,742 INFO L87 Difference]: Start difference. First operand 90 states and 428 transitions. Second operand 10 states. [2019-03-04 16:28:36,000 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-03-04 16:28:36,152 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-03-04 16:28:36,924 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-03-04 16:28:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:38,398 INFO L93 Difference]: Finished difference Result 142 states and 591 transitions. [2019-03-04 16:28:38,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:28:38,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:28:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:38,399 INFO L225 Difference]: With dead ends: 142 [2019-03-04 16:28:38,399 INFO L226 Difference]: Without dead ends: 138 [2019-03-04 16:28:38,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:28:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-03-04 16:28:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2019-03-04 16:28:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-03-04 16:28:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 489 transitions. [2019-03-04 16:28:39,570 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 489 transitions. Word has length 8 [2019-03-04 16:28:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:39,571 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 489 transitions. [2019-03-04 16:28:39,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:28:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 489 transitions. [2019-03-04 16:28:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:28:39,571 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:39,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:39,572 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:39,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:39,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-03-04 16:28:39,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:39,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:39,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:39,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:39,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:28:39,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:28:39,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:28:39,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:28:39,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:28:39,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:28:39,654 INFO L87 Difference]: Start difference. First operand 101 states and 489 transitions. Second operand 5 states. [2019-03-04 16:28:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:40,828 INFO L93 Difference]: Finished difference Result 106 states and 493 transitions. [2019-03-04 16:28:40,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:28:40,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-03-04 16:28:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:40,829 INFO L225 Difference]: With dead ends: 106 [2019-03-04 16:28:40,829 INFO L226 Difference]: Without dead ends: 101 [2019-03-04 16:28:40,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:28:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-03-04 16:28:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-03-04 16:28:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-03-04 16:28:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 487 transitions. [2019-03-04 16:28:41,998 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 487 transitions. Word has length 8 [2019-03-04 16:28:41,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:41,999 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 487 transitions. [2019-03-04 16:28:41,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:28:41,999 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 487 transitions. [2019-03-04 16:28:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:28:41,999 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:41,999 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:42,000 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:42,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:42,000 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-03-04 16:28:42,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:42,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:42,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:42,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:42,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:28:42,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:42,084 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:28:42,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:28:42,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:28:42,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:28:42,102 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:28:42,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:42,105 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:28:42,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:28:42,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,126 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:28:42,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,143 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:28:42,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:42,160 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:28:42,160 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:42,171 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:42,181 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:42,192 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:42,202 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:42,237 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:28:42,237 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:42,242 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:42,252 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:42,267 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:42,293 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:42,294 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:28:42,320 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:28:42,321 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:42,346 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:28:42,347 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:48 [2019-03-04 16:28:42,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, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 38 treesize of output 53 [2019-03-04 16:28:42,407 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:42,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:28:42,428 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:48 [2019-03-04 16:28:42,475 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 47 [2019-03-04 16:28:42,476 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:28:42,514 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:28:42,514 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:76 [2019-03-04 16:28:42,562 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:28:42,563 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:42,574 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:28:42,574 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:28:42,597 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:28:42,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:42,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:28:42,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:28:42,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:28:42,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:28:42,616 INFO L87 Difference]: Start difference. First operand 101 states and 487 transitions. Second operand 12 states. [2019-03-04 16:28:43,031 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-03-04 16:28:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:45,556 INFO L93 Difference]: Finished difference Result 182 states and 819 transitions. [2019-03-04 16:28:45,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:28:45,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:28:45,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:45,557 INFO L225 Difference]: With dead ends: 182 [2019-03-04 16:28:45,558 INFO L226 Difference]: Without dead ends: 172 [2019-03-04 16:28:45,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:28:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-03-04 16:28:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 118. [2019-03-04 16:28:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-03-04 16:28:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 581 transitions. [2019-03-04 16:28:47,408 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 581 transitions. Word has length 9 [2019-03-04 16:28:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:47,408 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 581 transitions. [2019-03-04 16:28:47,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:28:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 581 transitions. [2019-03-04 16:28:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:28:47,408 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:47,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:47,409 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:47,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:47,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-03-04 16:28:47,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:47,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:47,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:47,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:28:47,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:47,496 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:28:47,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:47,496 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:28:47,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:47,509 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:28:47,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:47,514 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:28:47,532 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:28:47,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,543 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:28:47,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,557 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:28:47,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:47,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:28:47,584 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:47,595 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:47,605 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:47,615 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:47,626 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:47,659 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:28:47,660 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:47,667 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:47,679 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:47,695 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:47,721 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:47,721 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:28:47,750 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:28:47,750 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:47,775 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:28:47,775 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:48 [2019-03-04 16:28:47,812 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 40 [2019-03-04 16:28:47,812 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:47,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:28:47,830 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-03-04 16:28:47,885 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 38 treesize of output 54 [2019-03-04 16:28:47,886 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:28:47,924 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:28:47,925 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:72 [2019-03-04 16:28:47,992 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:28:48,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:48,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:28:48,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:28:48,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:28:48,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:28:48,011 INFO L87 Difference]: Start difference. First operand 118 states and 581 transitions. Second operand 10 states. [2019-03-04 16:28:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:28:52,738 INFO L93 Difference]: Finished difference Result 230 states and 1115 transitions. [2019-03-04 16:28:52,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:28:52,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:28:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:28:52,739 INFO L225 Difference]: With dead ends: 230 [2019-03-04 16:28:52,739 INFO L226 Difference]: Without dead ends: 217 [2019-03-04 16:28:52,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:28:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-03-04 16:28:57,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 164. [2019-03-04 16:28:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-03-04 16:28:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 814 transitions. [2019-03-04 16:28:57,101 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 814 transitions. Word has length 9 [2019-03-04 16:28:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:28:57,101 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 814 transitions. [2019-03-04 16:28:57,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:28:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 814 transitions. [2019-03-04 16:28:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:28:57,102 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:28:57,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:28:57,102 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:28:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:28:57,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-03-04 16:28:57,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:28:57,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:28:57,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:57,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:57,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:28:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:57,203 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:28:57,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:28:57,204 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:28:57,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:28:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:28:57,217 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:28:57,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:28:57,222 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:28:57,237 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:28:57,242 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:28:57,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,260 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:28:57,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:28:57,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:28:57,274 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,284 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,295 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,305 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,316 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,348 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:28:57,348 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,355 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,365 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,381 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,407 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:28:57,407 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:28:57,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 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:28:57,453 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,470 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,470 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:35 [2019-03-04 16:28:57,500 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 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:28:57,500 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,512 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:28:57,512 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-03-04 16:28:57,552 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 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:28:57,553 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,564 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:28:57,564 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-03-04 16:28:57,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, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 49 [2019-03-04 16:28:57,616 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:28:57,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:28:57,631 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-03-04 16:28:57,654 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:28:57,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:28:57,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:28:57,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:28:57,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:28:57,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:28:57,672 INFO L87 Difference]: Start difference. First operand 164 states and 814 transitions. Second operand 12 states. [2019-03-04 16:29:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:02,933 INFO L93 Difference]: Finished difference Result 199 states and 937 transitions. [2019-03-04 16:29:02,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:29:02,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:29:02,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:02,934 INFO L225 Difference]: With dead ends: 199 [2019-03-04 16:29:02,934 INFO L226 Difference]: Without dead ends: 192 [2019-03-04 16:29:02,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:29:02,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-03-04 16:29:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 96. [2019-03-04 16:29:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-03-04 16:29:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 453 transitions. [2019-03-04 16:29:04,816 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 453 transitions. Word has length 9 [2019-03-04 16:29:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:04,816 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 453 transitions. [2019-03-04 16:29:04,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:29:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 453 transitions. [2019-03-04 16:29:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:29:04,817 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:04,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:29:04,817 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:04,817 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-03-04 16:29:04,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:04,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:04,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:04,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:04,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:04,989 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:29:04,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:04,989 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:29:05,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:05,006 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:29:05,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:05,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:29:05,021 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:29:05,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,029 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:29:05,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,040 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:29:05,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:05,056 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:29:05,057 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:05,066 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:05,075 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:05,086 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:05,095 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:05,130 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:29:05,130 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:05,135 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:05,145 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:05,160 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:05,187 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:05,187 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:29:05,231 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:29:05,231 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:05,247 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:29:05,247 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-03-04 16:29:05,280 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 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:29:05,281 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:05,293 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:29:05,293 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-03-04 16:29:05,354 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 9 case distinctions, treesize of input 33 treesize of output 42 [2019-03-04 16:29:05,354 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:05,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:29:05,367 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:29:05,387 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:29:05,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:05,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:29:05,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:29:05,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:29:05,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:29:05,405 INFO L87 Difference]: Start difference. First operand 96 states and 453 transitions. Second operand 10 states. [2019-03-04 16:29:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:08,498 INFO L93 Difference]: Finished difference Result 144 states and 619 transitions. [2019-03-04 16:29:08,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:29:08,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:29:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:08,499 INFO L225 Difference]: With dead ends: 144 [2019-03-04 16:29:08,499 INFO L226 Difference]: Without dead ends: 129 [2019-03-04 16:29:08,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:29:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-03-04 16:29:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2019-03-04 16:29:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:29:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 514 transitions. [2019-03-04 16:29:10,929 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 514 transitions. Word has length 9 [2019-03-04 16:29:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:10,929 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 514 transitions. [2019-03-04 16:29:10,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:29:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 514 transitions. [2019-03-04 16:29:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:29:10,929 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:10,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:29:10,930 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:10,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:10,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-03-04 16:29:10,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:10,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:10,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:10,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:10,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:11,118 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:29:11,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:11,118 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:29:11,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:11,133 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:29:11,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:11,204 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:29:11,204 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,209 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,218 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,232 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,253 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:29:11,266 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:29:11,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:29:11,276 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:29:11,286 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:29:11,286 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,295 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,304 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,314 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,323 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,349 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,350 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-03-04 16:29:11,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, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:29:11,387 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,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:29:11,411 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-03-04 16:29:11,461 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:29:11,462 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:29:11,502 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:29:11,503 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:80 [2019-03-04 16:29:11,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, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 48 [2019-03-04 16:29:11,608 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,782 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 52 treesize of output 57 [2019-03-04 16:29:11,783 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,818 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:29:11,819 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:70 [2019-03-04 16:29:11,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, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 62 [2019-03-04 16:29:11,909 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:11,961 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 5 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:29:11,962 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:12,006 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:29:12,006 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-03-04 16:29:12,051 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:29:12,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:12,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:29:12,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:29:12,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:29:12,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:29:12,069 INFO L87 Difference]: Start difference. First operand 108 states and 514 transitions. Second operand 12 states. [2019-03-04 16:29:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:15,941 INFO L93 Difference]: Finished difference Result 169 states and 718 transitions. [2019-03-04 16:29:15,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:29:15,941 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:29:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:15,942 INFO L225 Difference]: With dead ends: 169 [2019-03-04 16:29:15,942 INFO L226 Difference]: Without dead ends: 158 [2019-03-04 16:29:15,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:29:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-03-04 16:29:18,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2019-03-04 16:29:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:29:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 514 transitions. [2019-03-04 16:29:18,382 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 514 transitions. Word has length 9 [2019-03-04 16:29:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:18,382 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 514 transitions. [2019-03-04 16:29:18,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:29:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 514 transitions. [2019-03-04 16:29:18,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:29:18,382 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:18,383 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:29:18,383 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:18,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:18,383 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-03-04 16:29:18,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:18,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:18,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:18,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:18,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:18,476 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:29:18,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:18,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 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:29:18,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:18,501 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:29:18,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:18,508 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:29:18,524 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:29:18,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,531 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:29:18,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,547 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:29:18,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:18,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:29:18,565 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:18,574 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:18,585 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:18,595 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:18,606 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:18,640 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:29:18,640 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:18,647 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:18,659 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:18,674 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:18,701 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:18,701 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-03-04 16:29:18,720 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:29:18,720 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:18,744 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:29:18,744 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-03-04 16:29:18,780 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 45 [2019-03-04 16:29:18,781 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:29:18,819 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:29:18,819 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:76 [2019-03-04 16:29:18,863 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 5 case distinctions, treesize of input 33 treesize of output 31 [2019-03-04 16:29:18,863 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:18,874 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:29:18,874 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-03-04 16:29:18,891 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:29:18,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:18,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:29:18,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:29:18,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:29:18,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:29:18,909 INFO L87 Difference]: Start difference. First operand 108 states and 514 transitions. Second operand 10 states. [2019-03-04 16:29:22,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:22,895 INFO L93 Difference]: Finished difference Result 184 states and 811 transitions. [2019-03-04 16:29:22,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:29:22,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:29:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:22,896 INFO L225 Difference]: With dead ends: 184 [2019-03-04 16:29:22,896 INFO L226 Difference]: Without dead ends: 171 [2019-03-04 16:29:22,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:29:22,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-03-04 16:29:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 147. [2019-03-04 16:29:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-03-04 16:29:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 710 transitions. [2019-03-04 16:29:26,686 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 710 transitions. Word has length 9 [2019-03-04 16:29:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:26,686 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 710 transitions. [2019-03-04 16:29:26,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:29:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 710 transitions. [2019-03-04 16:29:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:29:26,687 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:26,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:29:26,687 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:26,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:26,687 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-03-04 16:29:26,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:26,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:26,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:26,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:26,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:26,872 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-03-04 16:29:26,953 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:29:26,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:26,953 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:29:26,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:26,968 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:29:26,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:26,988 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:29:26,988 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:26,994 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,003 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,019 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,037 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,058 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:29:27,061 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:29:27,064 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:29:27,067 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:29:27,071 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:29:27,071 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,080 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,090 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,100 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,109 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,138 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:27,138 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:29:27,171 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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:29:27,171 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,198 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:29:27,198 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-03-04 16:29:27,236 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 34 [2019-03-04 16:29:27,237 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,256 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:29:27,257 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:40 [2019-03-04 16:29:27,305 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:29:27,306 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:27,322 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:29:27,322 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-03-04 16:29:27,348 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:29:27,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:27,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:29:27,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:29:27,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:29:27,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:29:27,367 INFO L87 Difference]: Start difference. First operand 147 states and 710 transitions. Second operand 10 states. [2019-03-04 16:29:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:32,978 INFO L93 Difference]: Finished difference Result 204 states and 926 transitions. [2019-03-04 16:29:32,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:29:32,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:29:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:32,980 INFO L225 Difference]: With dead ends: 204 [2019-03-04 16:29:32,980 INFO L226 Difference]: Without dead ends: 191 [2019-03-04 16:29:32,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:29:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-03-04 16:29:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 167. [2019-03-04 16:29:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-03-04 16:29:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 814 transitions. [2019-03-04 16:29:37,701 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 814 transitions. Word has length 9 [2019-03-04 16:29:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:37,701 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 814 transitions. [2019-03-04 16:29:37,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:29:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 814 transitions. [2019-03-04 16:29:37,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:29:37,702 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:37,702 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:29:37,702 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:37,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:37,702 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-03-04 16:29:37,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:37,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:37,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:37,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:37,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:29:37,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:37,771 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:29:37,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:37,786 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:29:37,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:37,794 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:29:37,812 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:29:37,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,823 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:29:37,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:29:37,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:29:37,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:29:37,849 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:37,860 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:37,869 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:37,878 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:37,888 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:37,924 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:29:37,924 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:37,928 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:37,939 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:37,954 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:37,980 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:37,981 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:29:38,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, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:29:38,024 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:29:38,065 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:29:38,066 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 16:29:38,103 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:29:38,103 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:38,120 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:29:38,121 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:33 [2019-03-04 16:29:38,160 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 36 [2019-03-04 16:29:38,160 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:38,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:29:38,172 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-03-04 16:29:38,216 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 4 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 39 [2019-03-04 16:29:38,216 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:38,225 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:29:38,225 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-03-04 16:29:38,245 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:29:38,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:38,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:29:38,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:29:38,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:29:38,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:29:38,263 INFO L87 Difference]: Start difference. First operand 167 states and 814 transitions. Second operand 11 states. [2019-03-04 16:29:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:29:45,301 INFO L93 Difference]: Finished difference Result 248 states and 1179 transitions. [2019-03-04 16:29:45,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:29:45,301 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:29:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:29:45,302 INFO L225 Difference]: With dead ends: 248 [2019-03-04 16:29:45,303 INFO L226 Difference]: Without dead ends: 241 [2019-03-04 16:29:45,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:29:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-03-04 16:29:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 217. [2019-03-04 16:29:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-03-04 16:29:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1069 transitions. [2019-03-04 16:29:51,613 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1069 transitions. Word has length 9 [2019-03-04 16:29:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:29:51,613 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1069 transitions. [2019-03-04 16:29:51,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:29:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1069 transitions. [2019-03-04 16:29:51,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:29:51,614 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:29:51,614 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:29:51,614 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:29:51,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:29:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-03-04 16:29:51,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:29:51,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:29:51,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:51,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:51,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:29:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:29:51,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:29:51,716 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:29:51,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:29:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:29:51,747 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:29:51,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:29:51,775 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:29:51,775 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:51,783 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:51,795 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:51,814 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:51,837 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:29:51,850 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:29:51,855 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:29:51,860 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:29:51,865 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:29:51,865 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:51,874 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:51,883 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:51,893 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:51,902 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:29:51,929 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:29:51,929 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-03-04 16:29:51,961 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:29:51,962 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:29:52,007 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:29:52,008 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:100 [2019-03-04 16:29:52,084 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-03-04 16:29:52,085 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:52,148 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 5 case distinctions, treesize of input 45 treesize of output 47 [2019-03-04 16:29:52,149 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:52,183 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:29:52,183 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:116, output treesize:80 [2019-03-04 16:29:52,252 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 65 [2019-03-04 16:29:52,252 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:52,319 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:29:52,320 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:52,349 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:29:52,350 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-03-04 16:29:52,405 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 5 case distinctions, treesize of input 45 treesize of output 47 [2019-03-04 16:29:52,406 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:52,491 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 48 treesize of output 63 [2019-03-04 16:29:52,492 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:29:52,520 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:29:52,520 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-03-04 16:29:52,566 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:29:52,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:29:52,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 9 [2019-03-04 16:29:52,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:29:52,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:29:52,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:29:52,590 INFO L87 Difference]: Start difference. First operand 217 states and 1069 transitions. Second operand 11 states. [2019-03-04 16:30:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:00,947 INFO L93 Difference]: Finished difference Result 283 states and 1308 transitions. [2019-03-04 16:30:00,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:30:00,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:30:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:00,948 INFO L225 Difference]: With dead ends: 283 [2019-03-04 16:30:00,948 INFO L226 Difference]: Without dead ends: 270 [2019-03-04 16:30:00,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:30:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-03-04 16:30:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 216. [2019-03-04 16:30:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-03-04 16:30:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 1060 transitions. [2019-03-04 16:30:07,331 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 1060 transitions. Word has length 9 [2019-03-04 16:30:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:07,331 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 1060 transitions. [2019-03-04 16:30:07,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:30:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 1060 transitions. [2019-03-04 16:30:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:30:07,332 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:07,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:30:07,332 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:07,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:07,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-03-04 16:30:07,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:07,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:07,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:07,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:07,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:30:07,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:07,553 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:30:07,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:07,569 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:30:07,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:07,601 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:30:07,601 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,607 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,614 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,630 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,652 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:30:07,663 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:30:07,667 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:30:07,672 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:30:07,677 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:30:07,677 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,686 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,696 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,705 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,715 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,741 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:07,741 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:30:07,780 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:30:07,781 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:30:07,823 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:30:07,823 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:100 [2019-03-04 16:30:07,923 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 60 [2019-03-04 16:30:07,923 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:07,983 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 5 case distinctions, treesize of input 45 treesize of output 43 [2019-03-04 16:30:07,984 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:08,014 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:30:08,014 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-03-04 16:30:08,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, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-03-04 16:30:08,078 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:08,138 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:30:08,139 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:08,168 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:30:08,168 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:68 [2019-03-04 16:30:08,246 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 48 treesize of output 60 [2019-03-04 16:30:08,247 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:08,303 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 9 case distinctions, treesize of input 39 treesize of output 44 [2019-03-04 16:30:08,303 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:08,331 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:30:08,331 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-03-04 16:30:08,501 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-03-04 16:30:08,504 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:30:08,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:08,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:30:08,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:30:08,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:30:08,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:30:08,524 INFO L87 Difference]: Start difference. First operand 216 states and 1060 transitions. Second operand 12 states. [2019-03-04 16:30:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:20,385 INFO L93 Difference]: Finished difference Result 412 states and 1987 transitions. [2019-03-04 16:30:20,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:30:20,385 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:30:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:20,387 INFO L225 Difference]: With dead ends: 412 [2019-03-04 16:30:20,387 INFO L226 Difference]: Without dead ends: 404 [2019-03-04 16:30:20,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:30:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-03-04 16:30:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 264. [2019-03-04 16:30:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-03-04 16:30:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 1312 transitions. [2019-03-04 16:30:29,310 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 1312 transitions. Word has length 9 [2019-03-04 16:30:29,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:29,310 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 1312 transitions. [2019-03-04 16:30:29,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:30:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 1312 transitions. [2019-03-04 16:30:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:30:29,311 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:29,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:30:29,311 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:29,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:29,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-03-04 16:30:29,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:29,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:29,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:29,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:29,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:29,460 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:30:29,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:29,460 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:30:29,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:30:29,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:30:29,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:30:29,476 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:30:29,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:29,514 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:30:29,515 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:29,522 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:29,533 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:29,552 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:29,572 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:30:29,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:30:29,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:30:29,594 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:30:29,599 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:30:29,600 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:29,609 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:29,619 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:29,628 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:29,637 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:29,664 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:29,664 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:30:29,706 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 38 [2019-03-04 16:30:29,707 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:30:29,750 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:30:29,750 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:100 [2019-03-04 16:30:29,857 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 64 [2019-03-04 16:30:29,858 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:29,934 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 61 [2019-03-04 16:30:29,935 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:29,972 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:30:29,972 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-03-04 16:30:30,054 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:30:30,055 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:30,101 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 55 treesize of output 50 [2019-03-04 16:30:30,101 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:30,137 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:30:30,137 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:74 [2019-03-04 16:30:30,208 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 5 case distinctions, treesize of input 45 treesize of output 43 [2019-03-04 16:30:30,208 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:30,283 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 48 treesize of output 60 [2019-03-04 16:30:30,284 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:30,311 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:30:30,312 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-03-04 16:30:30,363 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:30:30,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:30,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-03-04 16:30:30,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:30:30,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:30:30,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:30:30,390 INFO L87 Difference]: Start difference. First operand 264 states and 1312 transitions. Second operand 13 states. [2019-03-04 16:30:30,919 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-03-04 16:30:31,457 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-03-04 16:30:32,693 WARN L181 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-03-04 16:30:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:40,779 INFO L93 Difference]: Finished difference Result 270 states and 1331 transitions. [2019-03-04 16:30:40,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:30:40,780 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-03-04 16:30:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:40,781 INFO L225 Difference]: With dead ends: 270 [2019-03-04 16:30:40,781 INFO L226 Difference]: Without dead ends: 263 [2019-03-04 16:30:40,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:30:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-03-04 16:30:42,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 38. [2019-03-04 16:30:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 16:30:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-03-04 16:30:42,418 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-03-04 16:30:42,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:42,418 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-03-04 16:30:42,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:30:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-03-04 16:30:42,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:30:42,418 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:42,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:30:42,418 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:42,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-03-04 16:30:42,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:42,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:42,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:42,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:30:42,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:42,510 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:30:42,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:42,510 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:30:42,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:42,524 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:30:42,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:42,531 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:30:42,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,536 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:30:42,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,545 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:30:42,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,557 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:30:42,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:42,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, 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:30:42,578 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,588 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,599 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,610 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,620 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,659 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-03-04 16:30:42,660 INFO L309 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,667 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,676 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,688 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,705 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,734 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:42,734 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-03-04 16:30:42,769 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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:30:42,769 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,796 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:30:42,796 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:52 [2019-03-04 16:30:42,834 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 36 [2019-03-04 16:30:42,834 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,853 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:30:42,853 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-03-04 16:30:42,901 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:30:42,902 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,918 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:30:42,918 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-03-04 16:30:42,980 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 40 treesize of output 52 [2019-03-04 16:30:42,981 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:42,997 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:30:42,997 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:30:43,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:30:43,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:43,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-03-04 16:30:43,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:30:43,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:30:43,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:30:43,296 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-03-04 16:30:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:46,767 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-03-04 16:30:46,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:30:46,767 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-03-04 16:30:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:46,768 INFO L225 Difference]: With dead ends: 67 [2019-03-04 16:30:46,768 INFO L226 Difference]: Without dead ends: 58 [2019-03-04 16:30:46,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:30:46,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-03-04 16:30:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-03-04 16:30:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 16:30:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-03-04 16:30:48,518 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-03-04 16:30:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:48,518 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-03-04 16:30:48,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:30:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-03-04 16:30:48,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:30:48,518 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:48,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:30:48,519 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:48,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:48,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-03-04 16:30:48,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:48,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:48,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:48,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:48,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-03-04 16:30:48,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:48,709 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:30:48,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:48,723 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:30:48,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:48,727 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:30:48,738 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:30:48,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,746 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:30:48,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,757 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:30:48,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:30:48,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:30:48,773 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,782 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,791 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,802 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,812 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,847 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:30:48,847 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,854 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,866 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,881 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,907 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,908 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-03-04 16:30:48,946 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:30:48,947 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:48,972 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:30:48,972 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:48 [2019-03-04 16:30:49,022 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 43 [2019-03-04 16:30:49,023 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:30:49,057 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:30:49,058 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:76 [2019-03-04 16:30:49,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, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 16:30:49,169 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:49,231 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 50 treesize of output 55 [2019-03-04 16:30:49,232 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:49,259 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-03-04 16:30:49,259 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-03-04 16:30:49,395 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 9 case distinctions, treesize of input 37 treesize of output 46 [2019-03-04 16:30:49,395 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:49,470 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 46 treesize of output 54 [2019-03-04 16:30:49,471 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:49,498 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-03-04 16:30:49,499 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:66 [2019-03-04 16:30:49,556 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:30:49,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:49,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:30:49,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:30:49,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:30:49,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:30:49,583 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-03-04 16:30:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:53,326 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-03-04 16:30:53,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:30:53,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-03-04 16:30:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:53,327 INFO L225 Difference]: With dead ends: 74 [2019-03-04 16:30:53,327 INFO L226 Difference]: Without dead ends: 59 [2019-03-04 16:30:53,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:30:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-03-04 16:30:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-03-04 16:30:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 16:30:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-03-04 16:30:55,133 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-03-04 16:30:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:30:55,133 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-03-04 16:30:55,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:30:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-03-04 16:30:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:30:55,134 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:30:55,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:30:55,134 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:30:55,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:30:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-03-04 16:30:55,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:30:55,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:30:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:55,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:30:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:55,292 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:30:55,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:30:55,293 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:30:55,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:30:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:30:55,306 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:30:55,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:30:55,335 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-03-04 16:30:55,336 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:55,345 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:55,356 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:55,371 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:55,390 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-03-04 16:30:55,401 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:30:55,405 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:30:55,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:30:55,415 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:30:55,415 INFO L309 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:55,424 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:55,434 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:55,443 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:55,457 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:30:55,484 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:30:55,485 INFO L209 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-03-04 16:30:55,531 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:30:55,531 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:55,547 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:30:55,547 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-03-04 16:30:55,580 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 5 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:30:55,580 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:55,593 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:30:55,593 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-03-04 16:30:55,633 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 9 case distinctions, treesize of input 33 treesize of output 38 [2019-03-04 16:30:55,634 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:55,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:30:55,643 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-03-04 16:30:55,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, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 47 [2019-03-04 16:30:55,694 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:30:55,706 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:30:55,707 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-03-04 16:30:55,727 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:30:55,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:30:55,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2019-03-04 16:30:55,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:30:55,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:30:55,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:30:55,746 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-03-04 16:30:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:30:59,894 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-03-04 16:30:59,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:30:59,895 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-03-04 16:30:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:30:59,895 INFO L225 Difference]: With dead ends: 80 [2019-03-04 16:30:59,896 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 16:30:59,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:30:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 16:31:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-03-04 16:31:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-03-04 16:31:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-03-04 16:31:03,361 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-03-04 16:31:03,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:03,361 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-03-04 16:31:03,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:31:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-03-04 16:31:03,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-03-04 16:31:03,361 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:31:03,361 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:31:03,361 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:31:03,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:31:03,362 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-03-04 16:31:03,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:31:03,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:31:03,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:03,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:31:03,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:31:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:31:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-03-04 16:31:03,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:31:03,476 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:31:03,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:31:03,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:31:03,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:31:03,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:31:03,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:31:03,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:31:03,509 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:31:03,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, 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:31:03,564 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:31:03,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:03,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:03,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:03,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:31:03,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, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:31:03,579 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:03,588 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:03,598 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:03,608 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:03,617 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:03,636 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:31:03,636 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:03,643 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:31:03,659 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:31:03,660 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-03-04 16:31:03,694 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2019-03-04 16:31:03,694 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:31:03,712 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-03-04 16:31:03,713 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:43 [2019-03-04 16:31:03,763 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 24 [2019-03-04 16:31:03,763 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:03,797 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 34 [2019-03-04 16:31:03,797 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:03,813 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-03-04 16:31:03,813 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-03-04 16:31:03,853 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 33 [2019-03-04 16:31:03,853 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:03,883 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:31:03,883 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:03,896 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-03-04 16:31:03,896 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-03-04 16:31:03,931 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:31:03,931 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:03,969 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 33 [2019-03-04 16:31:03,969 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:03,982 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-03-04 16:31:03,982 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:34 [2019-03-04 16:31:04,022 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:31:04,023 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:04,063 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 30 treesize of output 39 [2019-03-04 16:31:04,063 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:31:04,079 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-03-04 16:31:04,079 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:38 [2019-03-04 16:31:04,109 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:31:04,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:31:04,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-03-04 16:31:04,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:31:04,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:31:04,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:31:04,131 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-03-04 16:31:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:31:08,103 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-03-04 16:31:08,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:31:08,104 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-03-04 16:31:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:31:08,104 INFO L225 Difference]: With dead ends: 71 [2019-03-04 16:31:08,104 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:31:08,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:31:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:31:08,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:31:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:31:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:31:08,106 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-03-04 16:31:08,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:31:08,106 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:31:08,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:31:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:31:08,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:31:08,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:31:08,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:08,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:08,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:08,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:08,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:09,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:09,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:09,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:09,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:09,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:09,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:10,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:10,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:10,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:10,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:11,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:11,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:11,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:11,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:11,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:12,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:16,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:16,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:16,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:16,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:16,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:16,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:16,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:16,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:16,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:17,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:17,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:17,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:17,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:17,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:17,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:20,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:22,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:23,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:23,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:23,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:23,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:23,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:23,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:24,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:24,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:26,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:27,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:27,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:27,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:27,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:28,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:28,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:28,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:28,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:28,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:29,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:29,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:29,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:29,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:29,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:29,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:29,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:29,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:30,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:30,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:30,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:30,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:30,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:30,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:31,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:31,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:31,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:31,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:31,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:31,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:31,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:31,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:31,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:31,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:31,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:32,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:32,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:32,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:32,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:32,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:32,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:32,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:32,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:32,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:32,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:32,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:32,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:32,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:33,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:34,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:34,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:34,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:34,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:35,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:36,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:36,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:36,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:36,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:36,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:36,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:36,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:37,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:37,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:38,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:39,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:39,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:39,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:39,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:40,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:41,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:41,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:41,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:41,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:41,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:41,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:41,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:42,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:42,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:42,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:42,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:42,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:42,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:42,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:42,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:44,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:44,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:44,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:44,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:44,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:44,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:44,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:44,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:44,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:44,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:44,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:45,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:45,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:46,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:46,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:46,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:46,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:47,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:47,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:47,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:47,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:48,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:48,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:48,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:48,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:48,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:48,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:48,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:48,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:31:49,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:32:41,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:32:58,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:33:00,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:33:00,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:33:05,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:35:01,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:35:21,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:35:21,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:35:22,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:35:26,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:35:26,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:35:26,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent.