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-7-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:25:17,036 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:25:17,038 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:25:17,052 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:25:17,053 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:25:17,054 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:25:17,055 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:25:17,057 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:25:17,058 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:25:17,059 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:25:17,060 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:25:17,060 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:25:17,061 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:25:17,062 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:25:17,063 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:25:17,064 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:25:17,065 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:25:17,067 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:25:17,069 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:25:17,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:25:17,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:25:17,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:25:17,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:25:17,075 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:25:17,075 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:25:17,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:25:17,077 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:25:17,078 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:25:17,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:25:17,080 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:25:17,080 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:25:17,080 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:25:17,081 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:25:17,081 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:25:17,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:25:17,083 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:25:17,083 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:25:17,096 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:25:17,096 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:25:17,097 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:25:17,097 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:25:17,097 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:25:17,098 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:25:17,098 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:25:17,098 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:25:17,098 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:25:17,098 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:25:17,099 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:25:17,099 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:25:17,099 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:25:17,100 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:25:17,100 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:25:17,100 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:25:17,100 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:25:17,100 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:25:17,101 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:25:17,101 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:25:17,101 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:25:17,101 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:25:17,101 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:25:17,102 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:25:17,102 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:25:17,102 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:25:17,102 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:25:17,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:25:17,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:25:17,103 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:25:17,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:25:17,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:25:17,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:25:17,104 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:25:17,104 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:25:17,104 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:25:17,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:25:17,104 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:25:17,105 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:25:17,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:25:17,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:25:17,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:25:17,161 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:25:17,162 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:25:17,163 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl [2019-03-04 16:25:17,164 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl' [2019-03-04 16:25:17,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:25:17,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:25:17,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:25:17,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:25:17,206 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:25:17,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:25:17" (1/1) ... [2019-03-04 16:25:17,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:25:17" (1/1) ... [2019-03-04 16:25:17,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:25:17,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:25:17,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:25:17,261 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:25:17,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:25:17" (1/1) ... [2019-03-04 16:25:17,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:25:17" (1/1) ... [2019-03-04 16:25:17,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:25:17" (1/1) ... [2019-03-04 16:25:17,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:25:17" (1/1) ... [2019-03-04 16:25:17,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:25:17" (1/1) ... [2019-03-04 16:25:17,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:25:17" (1/1) ... [2019-03-04 16:25:17,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:25:17" (1/1) ... [2019-03-04 16:25:17,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:25:17,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:25:17,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:25:17,286 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:25:17,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:25: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:25:17,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:25:17,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:25:17,859 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:25:17,859 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-03-04 16:25:17,860 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:25:17 BoogieIcfgContainer [2019-03-04 16:25:17,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:25:17,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:25:17,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:25:17,865 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:25:17,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:25:17" (1/2) ... [2019-03-04 16:25:17,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7872ce and model type speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:25:17, skipping insertion in model container [2019-03-04 16:25:17,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:25:17" (2/2) ... [2019-03-04 16:25:17,868 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-unlimited.bpl [2019-03-04 16:25:17,878 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:25:17,885 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-03-04 16:25:17,902 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-03-04 16:25:17,937 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:25:17,937 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:25:17,938 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:25:17,938 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:25:17,938 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:25:17,938 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:25:17,938 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:25:17,939 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:25:17,939 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:25:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-03-04 16:25:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:25:17,974 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:17,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:25:17,978 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:17,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:17,987 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-03-04 16:25:17,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:17,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:18,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:18,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:18,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:18,199 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:25:18,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:25:18,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:25:18,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:25:18,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:25:18,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:25:18,220 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-03-04 16:25:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:18,391 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-03-04 16:25:18,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:25:18,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:25:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:18,407 INFO L225 Difference]: With dead ends: 33 [2019-03-04 16:25:18,407 INFO L226 Difference]: Without dead ends: 28 [2019-03-04 16:25:18,410 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:25:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-03-04 16:25:18,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-03-04 16:25:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:25:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-03-04 16:25:18,447 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-03-04 16:25:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:18,448 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-03-04 16:25:18,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:25:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-03-04 16:25:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:25:18,450 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:18,450 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:25:18,450 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:18,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:18,451 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-03-04 16:25:18,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:18,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:18,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:18,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:18,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:18,550 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:25:18,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:25:18,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:25:18,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:25:18,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:25:18,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:25:18,553 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-03-04 16:25:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:18,776 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-03-04 16:25:18,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:25:18,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:25:18,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:18,778 INFO L225 Difference]: With dead ends: 28 [2019-03-04 16:25:18,778 INFO L226 Difference]: Without dead ends: 27 [2019-03-04 16:25:18,779 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:25:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-03-04 16:25:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-03-04 16:25:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:25:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-03-04 16:25:18,783 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-03-04 16:25:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:18,784 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-03-04 16:25:18,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:25:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-03-04 16:25:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:25:18,785 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:18,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:25:18,785 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:18,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:18,786 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-03-04 16:25:18,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:18,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:18,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:18,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:18,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:19,020 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-03-04 16:25:19,098 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:19,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:19,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 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:25:19,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:19,148 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:25:19,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:19,411 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:19,413 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,426 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:19,454 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,644 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,732 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,795 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,929 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:25:19,945 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:19,959 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:25:19,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:25:20,043 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:20,076 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:20,157 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:20,159 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,175 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,193 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,214 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,413 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,520 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,537 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,600 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:20,600 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:20,702 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:20,703 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:20,873 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:20,874 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:20,918 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:20,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:20,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:25:20,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:25:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:25:20,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:20,942 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-03-04 16:25:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:21,422 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-03-04 16:25:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:25:21,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:25:21,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:21,426 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:25:21,426 INFO L226 Difference]: Without dead ends: 52 [2019-03-04 16:25:21,427 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:25:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-03-04 16:25:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-03-04 16:25:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-03-04 16:25:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-03-04 16:25:21,433 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-03-04 16:25:21,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:21,433 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-03-04 16:25:21,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:25:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-03-04 16:25:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:25:21,434 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:21,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:25:21,434 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:21,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:21,435 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-03-04 16:25:21,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:21,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:21,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:21,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:21,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:21,496 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:21,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:21,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 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:25:21,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:21,532 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:25:21,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:21,613 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:21,614 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,630 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,642 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,655 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,688 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,723 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,827 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:25:21,845 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:21,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, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:25:21,877 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:25:21,901 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:21,918 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:21,974 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:21,976 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:21,992 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,017 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,031 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,047 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,061 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,077 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,131 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:22,131 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:22,179 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:22,180 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,230 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:22,230 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-03-04 16:25:22,310 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:22,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:22,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:25:22,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:25:22,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:25:22,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:22,332 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 6 states. [2019-03-04 16:25:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:22,537 INFO L93 Difference]: Finished difference Result 42 states and 75 transitions. [2019-03-04 16:25:22,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:25:22,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:25:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:22,539 INFO L225 Difference]: With dead ends: 42 [2019-03-04 16:25:22,539 INFO L226 Difference]: Without dead ends: 41 [2019-03-04 16:25:22,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-03-04 16:25:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2019-03-04 16:25:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-03-04 16:25:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 57 transitions. [2019-03-04 16:25:22,545 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 57 transitions. Word has length 3 [2019-03-04 16:25:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:22,545 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 57 transitions. [2019-03-04 16:25:22,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:25:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 57 transitions. [2019-03-04 16:25:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:25:22,546 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:22,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:25:22,547 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:22,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-03-04 16:25:22,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:22,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:22,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:22,621 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:22,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:22,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:22,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:22,636 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:25:22,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:22,658 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 24 treesize of output 27 [2019-03-04 16:25:22,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,671 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 27 treesize of output 29 [2019-03-04 16:25:22,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,684 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 29 treesize of output 31 [2019-03-04 16:25:22,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,700 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:25:22,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,734 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:22,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,763 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:22,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:22,942 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:22,944 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,959 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:22,983 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,001 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,018 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,032 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,048 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,141 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:23,142 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,161 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,170 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,185 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,204 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,242 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,341 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:23,342 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:23,588 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-03-04 16:25:23,598 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:23,599 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:23,663 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:23,664 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:23,683 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:23,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:23,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:25:23,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:25:23,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:25:23,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:23,703 INFO L87 Difference]: Start difference. First operand 22 states and 57 transitions. Second operand 6 states. [2019-03-04 16:25:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:24,092 INFO L93 Difference]: Finished difference Result 56 states and 102 transitions. [2019-03-04 16:25:24,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:25:24,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:25:24,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:24,095 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:25:24,096 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:25:24,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:25:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:25:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 23. [2019-03-04 16:25:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-03-04 16:25:24,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 65 transitions. [2019-03-04 16:25:24,104 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 65 transitions. Word has length 3 [2019-03-04 16:25:24,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:24,104 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 65 transitions. [2019-03-04 16:25:24,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:25:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 65 transitions. [2019-03-04 16:25:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:25:24,105 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:24,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:25:24,106 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:24,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:24,106 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-03-04 16:25:24,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:24,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:24,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:24,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:24,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:24,231 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:24,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:24,231 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:25:24,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:24,260 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:25:24,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:24,278 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 24 treesize of output 27 [2019-03-04 16:25:24,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,290 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 27 treesize of output 29 [2019-03-04 16:25:24,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,300 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:25:24,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:25:24,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,344 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:24,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,381 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:24,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:24,484 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:24,486 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,504 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,520 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,536 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,552 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,568 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,584 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,680 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:24,681 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,736 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,746 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,757 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,776 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,805 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,860 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:24,861 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:24,916 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:24,917 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:24,960 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:24,961 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:25,003 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:25,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:25,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:25:25,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:25:25,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:25:25,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:25,022 INFO L87 Difference]: Start difference. First operand 23 states and 65 transitions. Second operand 6 states. [2019-03-04 16:25:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:25,279 INFO L93 Difference]: Finished difference Result 57 states and 110 transitions. [2019-03-04 16:25:25,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:25:25,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:25:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:25,281 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:25:25,281 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:25:25,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:25:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 26. [2019-03-04 16:25:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:25:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2019-03-04 16:25:25,289 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 3 [2019-03-04 16:25:25,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:25,289 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2019-03-04 16:25:25,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:25:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2019-03-04 16:25:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:25,290 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:25,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:25,290 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:25,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:25,291 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-03-04 16:25:25,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:25,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:25,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:25,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:25,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:25,400 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:25:25,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:25:25,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:25:25,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:25:25,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:25:25,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:25:25,402 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 4 states. [2019-03-04 16:25:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:25,501 INFO L93 Difference]: Finished difference Result 34 states and 89 transitions. [2019-03-04 16:25:25,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:25:25,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:25:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:25,502 INFO L225 Difference]: With dead ends: 34 [2019-03-04 16:25:25,502 INFO L226 Difference]: Without dead ends: 33 [2019-03-04 16:25:25,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:25:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-03-04 16:25:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-03-04 16:25:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-03-04 16:25:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 86 transitions. [2019-03-04 16:25:25,508 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 86 transitions. Word has length 4 [2019-03-04 16:25:25,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:25,508 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 86 transitions. [2019-03-04 16:25:25,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:25:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 86 transitions. [2019-03-04 16:25:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:25,509 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:25,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:25,510 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:25,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-03-04 16:25:25,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:25,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:25,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:25,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:25,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:25,633 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:25,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:25,634 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:25:25,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:25,650 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:25:25,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:25,661 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:25:25,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,667 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 27 treesize of output 29 [2019-03-04 16:25:25,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,681 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 29 treesize of output 31 [2019-03-04 16:25:25,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,700 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:25:25,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,717 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:25,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:25,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:25,824 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:25,825 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,844 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,861 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,876 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:25,893 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,079 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,175 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,240 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:26,241 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,247 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,257 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,279 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,306 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,337 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,389 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:26,389 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:26,435 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:26,436 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:26,478 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:26,479 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:26,498 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:26,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:26,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:25:26,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:25:26,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:25:26,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:26,521 INFO L87 Difference]: Start difference. First operand 29 states and 86 transitions. Second operand 6 states. [2019-03-04 16:25:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:26,907 INFO L93 Difference]: Finished difference Result 48 states and 117 transitions. [2019-03-04 16:25:26,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:25:26,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:25:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:26,909 INFO L225 Difference]: With dead ends: 48 [2019-03-04 16:25:26,909 INFO L226 Difference]: Without dead ends: 47 [2019-03-04 16:25:26,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-03-04 16:25:26,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-03-04 16:25:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:25:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 96 transitions. [2019-03-04 16:25:26,916 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 96 transitions. Word has length 4 [2019-03-04 16:25:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:26,917 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 96 transitions. [2019-03-04 16:25:26,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:25:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 96 transitions. [2019-03-04 16:25:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:26,917 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:26,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:26,918 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:26,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:26,918 INFO L82 PathProgramCache]: Analyzing trace with hash 941036, now seen corresponding path program 1 times [2019-03-04 16:25:26,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:26,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:26,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:26,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:26,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:27,025 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:27,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:27,026 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:25:27,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:27,059 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:27,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:27,082 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:25:27,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,086 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:27,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,100 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 29 treesize of output 31 [2019-03-04 16:25:27,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,113 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 31 treesize of output 33 [2019-03-04 16:25:27,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:27,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,199 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:27,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:27,268 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:27,270 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,284 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,299 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,314 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,330 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,344 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,360 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,429 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:27,430 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,436 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,446 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,457 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:27,478 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,507 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,561 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:27,561 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:27,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:27,687 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,002 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:28,002 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:28,186 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-03-04 16:25:28,282 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:25:28,283 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:28,319 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:28,320 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-03-04 16:25:28,340 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:28,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:28,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:28,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:28,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:28,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:28,361 INFO L87 Difference]: Start difference. First operand 31 states and 96 transitions. Second operand 8 states. [2019-03-04 16:25:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:28,809 INFO L93 Difference]: Finished difference Result 68 states and 194 transitions. [2019-03-04 16:25:28,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:28,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:25:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:28,810 INFO L225 Difference]: With dead ends: 68 [2019-03-04 16:25:28,811 INFO L226 Difference]: Without dead ends: 67 [2019-03-04 16:25:28,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:28,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-03-04 16:25:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 39. [2019-03-04 16:25:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 16:25:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 162 transitions. [2019-03-04 16:25:28,823 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 162 transitions. Word has length 4 [2019-03-04 16:25:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:28,823 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 162 transitions. [2019-03-04 16:25:28,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 162 transitions. [2019-03-04 16:25:28,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:28,824 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:28,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:28,825 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:28,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:28,825 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-03-04 16:25:28,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:28,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:28,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:29,024 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,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:29,025 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:25:29,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:29,042 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:29,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:29,093 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:29,094 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,098 INFO L309 ElimStorePlain]: Start of recursive call 6: 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 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,127 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,148 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,178 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,214 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:25:29,218 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:29,223 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:25:29,235 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:25:29,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:29,243 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:29,319 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:29,320 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,337 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,354 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,371 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,392 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,414 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,431 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,493 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:25:29,494 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:29,561 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:29,562 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,613 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:29,614 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:29,661 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:25:29,662 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:29,695 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:29,696 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:25:29,727 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,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:29,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:29,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:29,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:29,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:29,747 INFO L87 Difference]: Start difference. First operand 39 states and 162 transitions. Second operand 8 states. [2019-03-04 16:25:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:30,236 INFO L93 Difference]: Finished difference Result 78 states and 211 transitions. [2019-03-04 16:25:30,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:30,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:25:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:30,238 INFO L225 Difference]: With dead ends: 78 [2019-03-04 16:25:30,238 INFO L226 Difference]: Without dead ends: 77 [2019-03-04 16:25:30,238 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:25:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-03-04 16:25:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 37. [2019-03-04 16:25:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:25:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 146 transitions. [2019-03-04 16:25:30,248 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 146 transitions. Word has length 4 [2019-03-04 16:25:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:30,248 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 146 transitions. [2019-03-04 16:25:30,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 146 transitions. [2019-03-04 16:25:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:30,249 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:30,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:30,250 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:30,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:30,250 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-03-04 16:25:30,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:30,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:30,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:30,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:30,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:30,329 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,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:30,330 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:25:30,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:30,344 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:30,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:30,404 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:30,405 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,417 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,437 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,462 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,494 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,534 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,579 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:25:30,583 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:30,588 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:25:30,592 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:25:30,595 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:30,602 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:30,685 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:30,687 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,707 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,722 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,737 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,752 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,766 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,780 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,830 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:25:30,830 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:30,902 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:30,903 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:30,948 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:30,949 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:30,998 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:25:31,000 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:31,032 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:31,032 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:25:31,113 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:31,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:31,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:31,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:31,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:31,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:31,134 INFO L87 Difference]: Start difference. First operand 37 states and 146 transitions. Second operand 8 states. [2019-03-04 16:25:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:32,672 INFO L93 Difference]: Finished difference Result 77 states and 202 transitions. [2019-03-04 16:25:32,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:32,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:25:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:32,674 INFO L225 Difference]: With dead ends: 77 [2019-03-04 16:25:32,674 INFO L226 Difference]: Without dead ends: 75 [2019-03-04 16:25:32,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:25:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-03-04 16:25:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2019-03-04 16:25:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:25:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 158 transitions. [2019-03-04 16:25:32,687 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 158 transitions. Word has length 4 [2019-03-04 16:25:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:32,687 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 158 transitions. [2019-03-04 16:25:32,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 158 transitions. [2019-03-04 16:25:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:32,688 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:32,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:32,688 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-03-04 16:25:32,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:32,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:32,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:32,755 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:32,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:25:32,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:25:32,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:25:32,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:25:32,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:25:32,756 INFO L87 Difference]: Start difference. First operand 41 states and 158 transitions. Second operand 4 states. [2019-03-04 16:25:33,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:33,228 INFO L93 Difference]: Finished difference Result 55 states and 179 transitions. [2019-03-04 16:25:33,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:25:33,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:25:33,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:33,230 INFO L225 Difference]: With dead ends: 55 [2019-03-04 16:25:33,230 INFO L226 Difference]: Without dead ends: 54 [2019-03-04 16:25:33,231 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:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-03-04 16:25:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2019-03-04 16:25:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-03-04 16:25:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 167 transitions. [2019-03-04 16:25:33,242 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 167 transitions. Word has length 4 [2019-03-04 16:25:33,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:33,242 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 167 transitions. [2019-03-04 16:25:33,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:25:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 167 transitions. [2019-03-04 16:25:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:33,243 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:33,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:33,244 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:33,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:33,244 INFO L82 PathProgramCache]: Analyzing trace with hash 945688, now seen corresponding path program 1 times [2019-03-04 16:25:33,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:33,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:33,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:33,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:33,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:33,342 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:33,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:33,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 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:25:33,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:33,357 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:25:33,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:33,393 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:25:33,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,435 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 27 treesize of output 29 [2019-03-04 16:25:33,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,445 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 29 treesize of output 31 [2019-03-04 16:25:33,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,473 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 31 treesize of output 33 [2019-03-04 16:25:33,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,484 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,486 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,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,491 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:33,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,533 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:33,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:33,657 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:33,659 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,673 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,689 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:33,705 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,721 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,919 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,109 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,169 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:34,170 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,174 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,180 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,195 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,216 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,245 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,295 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:34,295 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:34,339 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:34,339 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:34,392 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:34,392 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-03-04 16:25:34,419 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:34,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:34,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:25:34,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:25:34,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:25:34,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:34,438 INFO L87 Difference]: Start difference. First operand 43 states and 167 transitions. Second operand 6 states. [2019-03-04 16:25:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:34,716 INFO L93 Difference]: Finished difference Result 71 states and 207 transitions. [2019-03-04 16:25:34,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:25:34,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:25:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:34,718 INFO L225 Difference]: With dead ends: 71 [2019-03-04 16:25:34,718 INFO L226 Difference]: Without dead ends: 69 [2019-03-04 16:25:34,718 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:25:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-03-04 16:25:34,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 45. [2019-03-04 16:25:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-03-04 16:25:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 176 transitions. [2019-03-04 16:25:34,730 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 176 transitions. Word has length 4 [2019-03-04 16:25:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:34,730 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 176 transitions. [2019-03-04 16:25:34,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:25:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 176 transitions. [2019-03-04 16:25:34,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:34,731 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:34,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:34,732 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:34,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:34,732 INFO L82 PathProgramCache]: Analyzing trace with hash 945252, now seen corresponding path program 1 times [2019-03-04 16:25:34,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:34,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:34,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:34,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:34,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:34,841 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:34,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:34,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:34,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:34,865 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:34,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:34,871 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:25:34,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,876 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 27 treesize of output 29 [2019-03-04 16:25:34,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,892 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 29 treesize of output 31 [2019-03-04 16:25:34,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,905 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 31 treesize of output 33 [2019-03-04 16:25:34,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,927 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:34,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,936 INFO L188 IndexEqualityManager]: detected not equals via solver [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,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,949 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 L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:34,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:34,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:35,036 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:35,037 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,164 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,182 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,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:35,227 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,244 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,263 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,338 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:35,339 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,344 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,360 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,381 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,403 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,431 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,480 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:25:35,481 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:35,528 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:35,528 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,572 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,572 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:25:35,689 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:25:35,690 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:35,722 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:35,723 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:25:35,741 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:35,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:35,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:35,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:35,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:35,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:35,763 INFO L87 Difference]: Start difference. First operand 45 states and 176 transitions. Second operand 8 states. [2019-03-04 16:25:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:36,242 INFO L93 Difference]: Finished difference Result 91 states and 255 transitions. [2019-03-04 16:25:36,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:36,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:25:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:36,244 INFO L225 Difference]: With dead ends: 91 [2019-03-04 16:25:36,244 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:25:36,245 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:25:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:25:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2019-03-04 16:25:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:25:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 211 transitions. [2019-03-04 16:25:36,254 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 211 transitions. Word has length 4 [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 52 states and 211 transitions. [2019-03-04 16:25:36,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 211 transitions. [2019-03-04 16:25:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:36,255 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:36,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:36,256 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:36,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:36,256 INFO L82 PathProgramCache]: Analyzing trace with hash 945004, now seen corresponding path program 1 times [2019-03-04 16:25:36,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:36,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:36,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:36,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:36,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:36,641 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-03-04 16:25:36,660 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,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:36,661 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:25:36,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:36,677 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:36,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:36,740 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:36,740 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,756 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:36,779 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,814 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,853 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,894 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,944 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:25:36,947 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:25:36,956 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:25:36,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:25:36,978 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:36,986 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:37,034 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:37,035 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,048 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,063 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,076 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,091 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,106 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,121 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,169 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:25:37,169 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:37,255 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:37,256 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,298 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:37,299 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:25:37,338 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:25:37,339 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:37,396 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:37,396 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:25:37,474 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:37,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:37,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:37,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:37,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:37,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:37,494 INFO L87 Difference]: Start difference. First operand 52 states and 211 transitions. Second operand 8 states. [2019-03-04 16:25:38,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:38,345 INFO L93 Difference]: Finished difference Result 107 states and 320 transitions. [2019-03-04 16:25:38,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:25:38,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:25:38,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:38,348 INFO L225 Difference]: With dead ends: 107 [2019-03-04 16:25:38,348 INFO L226 Difference]: Without dead ends: 106 [2019-03-04 16:25:38,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-03-04 16:25:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 57. [2019-03-04 16:25:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-03-04 16:25:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 251 transitions. [2019-03-04 16:25:38,363 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 251 transitions. Word has length 4 [2019-03-04 16:25:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:38,363 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 251 transitions. [2019-03-04 16:25:38,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 251 transitions. [2019-03-04 16:25:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:38,364 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:38,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:38,365 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:38,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:38,365 INFO L82 PathProgramCache]: Analyzing trace with hash 945500, now seen corresponding path program 1 times [2019-03-04 16:25:38,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:38,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:38,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:38,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:38,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:38,450 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:38,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:38,451 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:25:38,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:38,471 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:38,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:38,476 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 24 treesize of output 27 [2019-03-04 16:25:38,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,483 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 27 treesize of output 29 [2019-03-04 16:25:38,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,494 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 29 treesize of output 31 [2019-03-04 16:25:38,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,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 31 treesize of output 33 [2019-03-04 16:25:38,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,554 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:38,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,615 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:38,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:38,699 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:38,700 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,717 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,735 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,752 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,767 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,780 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,794 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,876 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:38,877 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,880 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,889 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,949 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,970 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:38,999 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,045 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:25:39,045 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:39,116 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:39,116 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,367 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:39,368 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:25:39,436 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:25:39,437 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:39,467 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:39,468 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:25:39,515 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:39,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:39,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:39,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:39,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:39,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:39,535 INFO L87 Difference]: Start difference. First operand 57 states and 251 transitions. Second operand 8 states. [2019-03-04 16:25:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:40,076 INFO L93 Difference]: Finished difference Result 99 states and 326 transitions. [2019-03-04 16:25:40,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:40,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:25:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:40,078 INFO L225 Difference]: With dead ends: 99 [2019-03-04 16:25:40,078 INFO L226 Difference]: Without dead ends: 97 [2019-03-04 16:25:40,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:25:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-03-04 16:25:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 61. [2019-03-04 16:25:40,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:25:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 283 transitions. [2019-03-04 16:25:40,094 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 283 transitions. Word has length 4 [2019-03-04 16:25:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:40,095 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 283 transitions. [2019-03-04 16:25:40,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 283 transitions. [2019-03-04 16:25:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:40,096 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:40,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:40,096 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash 933968, now seen corresponding path program 1 times [2019-03-04 16:25:40,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:40,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:40,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:40,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:40,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:40,168 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,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:40,169 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:25:40,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:40,185 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:40,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:40,194 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 24 treesize of output 27 [2019-03-04 16:25:40,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,206 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 27 treesize of output 29 [2019-03-04 16:25:40,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,215 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:25:40,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,228 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:25:40,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,240 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,249 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:40,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,273 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:40,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:40,342 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:40,343 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,359 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,375 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,391 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,407 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,423 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,438 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,516 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:40,516 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,523 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,535 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,548 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,571 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,600 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,646 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:25:40,647 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:40,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:25:40,693 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,735 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,736 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:25:40,778 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:25:40,779 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:40,824 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:40,825 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:25:40,867 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,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:40,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:40,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:40,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:40,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:40,888 INFO L87 Difference]: Start difference. First operand 61 states and 283 transitions. Second operand 8 states. [2019-03-04 16:25:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:41,526 INFO L93 Difference]: Finished difference Result 100 states and 333 transitions. [2019-03-04 16:25:41,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:25:41,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:25:41,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:41,528 INFO L225 Difference]: With dead ends: 100 [2019-03-04 16:25:41,528 INFO L226 Difference]: Without dead ends: 98 [2019-03-04 16:25:41,529 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:25:41,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-03-04 16:25:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 62. [2019-03-04 16:25:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-03-04 16:25:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 291 transitions. [2019-03-04 16:25:41,548 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 291 transitions. Word has length 4 [2019-03-04 16:25:41,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:41,548 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 291 transitions. [2019-03-04 16:25:41,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 291 transitions. [2019-03-04 16:25:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:41,550 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:41,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:41,550 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:41,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:41,550 INFO L82 PathProgramCache]: Analyzing trace with hash 949406, now seen corresponding path program 1 times [2019-03-04 16:25:41,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:41,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:41,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:41,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:41,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:41,732 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2019-03-04 16:25:41,771 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:41,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:41,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 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:25:41,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:41,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:41,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:41,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 24 treesize of output 27 [2019-03-04 16:25:41,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,802 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 27 treesize of output 29 [2019-03-04 16:25:41,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,818 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 29 treesize of output 31 [2019-03-04 16:25:41,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,830 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 31 treesize of output 33 [2019-03-04 16:25:41,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:41,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,072 INFO L301 Elim1Store]: Index analysis took 217 ms [2019-03-04 16:25:42,073 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:42,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,136 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,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,436 INFO L301 Elim1Store]: Index analysis took 334 ms [2019-03-04 16:25:42,437 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:42,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:42,544 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:42,545 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,560 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,577 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,591 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,608 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,624 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,639 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,711 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:42,711 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,713 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,721 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,732 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:42,751 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,779 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,827 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:25:42,828 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:42,881 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:25:42,882 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:25:42,948 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-03-04 16:25:42,948 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:152 [2019-03-04 16:25:43,116 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 88 treesize of output 125 [2019-03-04 16:25:43,131 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-03-04 16:25:43,668 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 113 [2019-03-04 16:25:43,669 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:44,005 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-03-04 16:25:44,005 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:455 [2019-03-04 16:25:46,359 WARN L181 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-03-04 16:25:46,360 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:46,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:46,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:25:46,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:25:46,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:25:46,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:25:46,379 INFO L87 Difference]: Start difference. First operand 62 states and 291 transitions. Second operand 8 states. [2019-03-04 16:25:52,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:52,056 INFO L93 Difference]: Finished difference Result 107 states and 383 transitions. [2019-03-04 16:25:52,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:25:52,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:25:52,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:52,058 INFO L225 Difference]: With dead ends: 107 [2019-03-04 16:25:52,059 INFO L226 Difference]: Without dead ends: 99 [2019-03-04 16:25:52,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:25:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-03-04 16:25:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 61. [2019-03-04 16:25:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:25:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 310 transitions. [2019-03-04 16:25:52,076 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 310 transitions. Word has length 4 [2019-03-04 16:25:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:52,076 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 310 transitions. [2019-03-04 16:25:52,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:25:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 310 transitions. [2019-03-04 16:25:52,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:52,077 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:52,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:52,078 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:52,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:52,078 INFO L82 PathProgramCache]: Analyzing trace with hash 951454, now seen corresponding path program 1 times [2019-03-04 16:25:52,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:52,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:52,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:52,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:52,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:52,157 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:52,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:52,158 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:25:52,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:52,186 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:25:52,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:52,221 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 24 treesize of output 27 [2019-03-04 16:25:52,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,275 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 27 treesize of output 29 [2019-03-04 16:25:52,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,370 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 29 treesize of output 31 [2019-03-04 16:25:52,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,540 INFO L301 Elim1Store]: Index analysis took 144 ms [2019-03-04 16:25:52,541 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 31 treesize of output 33 [2019-03-04 16:25:52,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,797 INFO L301 Elim1Store]: Index analysis took 227 ms [2019-03-04 16:25:52,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:52,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:52,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,183 INFO L301 Elim1Store]: Index analysis took 355 ms [2019-03-04 16:25:53,185 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:53,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:53,669 INFO L301 Elim1Store]: Index analysis took 456 ms [2019-03-04 16:25:53,670 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:25:53,671 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:53,852 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,991 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,006 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,023 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,040 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,057 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,134 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:25:54,134 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,150 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,163 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,186 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,217 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,253 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,303 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,369 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:54,370 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:118, output treesize:120 [2019-03-04 16:25:54,395 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:25:54,396 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:54,524 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:54,525 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-03-04 16:25:54,696 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:54,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:25:54,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:25:54,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:25:54,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:25:54,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:25:54,715 INFO L87 Difference]: Start difference. First operand 61 states and 310 transitions. Second operand 6 states. [2019-03-04 16:25:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:55,016 INFO L93 Difference]: Finished difference Result 84 states and 346 transitions. [2019-03-04 16:25:55,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:25:55,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:25:55,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:55,017 INFO L225 Difference]: With dead ends: 84 [2019-03-04 16:25:55,018 INFO L226 Difference]: Without dead ends: 83 [2019-03-04 16:25:55,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:25:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-03-04 16:25:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 62. [2019-03-04 16:25:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-03-04 16:25:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 318 transitions. [2019-03-04 16:25:55,034 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 318 transitions. Word has length 4 [2019-03-04 16:25:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:55,034 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 318 transitions. [2019-03-04 16:25:55,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:25:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 318 transitions. [2019-03-04 16:25:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:25:55,035 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:55,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:25:55,035 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash 951018, now seen corresponding path program 1 times [2019-03-04 16:25:55,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:55,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:55,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:55,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:55,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:55,197 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-03-04 16:25:55,223 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:55,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:55,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 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:25:55,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:55,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:25:55,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:55,246 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 24 treesize of output 27 [2019-03-04 16:25:55,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,250 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 27 treesize of output 29 [2019-03-04 16:25:55,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,345 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:25:55,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,509 INFO L301 Elim1Store]: Index analysis took 139 ms [2019-03-04 16:25:55,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:25:55,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,576 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:25:55,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,635 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:25:55,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:25:55,702 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:55,703 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,716 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,730 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,755 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,769 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,785 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,800 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,861 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:25:55,862 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,871 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,882 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,900 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,923 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:55,953 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:25:56,000 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:25:56,001 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:25:56,280 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 46 treesize of output 83 [2019-03-04 16:25:56,281 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-03-04 16:25:56,292 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 64 xjuncts. [2019-03-04 16:25:56,714 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 29 dim-0 vars, and 7 xjuncts. [2019-03-04 16:25:56,715 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:643 [2019-03-04 16:25:59,324 WARN L181 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 319 DAG size of output: 143 [2019-03-04 16:25:59,376 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 99 [2019-03-04 16:25:59,377 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:59,612 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 81 treesize of output 79 [2019-03-04 16:25:59,614 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:59,814 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 111 [2019-03-04 16:25:59,815 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:59,919 INFO L309 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 3 dim-1 vars, End of recursive call: 15 dim-0 vars, and 3 xjuncts. [2019-03-04 16:25:59,920 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 18 variables, input treesize:296, output treesize:206 [2019-03-04 16:26:05,412 WARN L181 SmtUtils]: Spent 5.40 s on a formula simplification that was a NOOP. DAG size: 121 [2019-03-04 16:26:05,414 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:05,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:05,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:05,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:05,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:05,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:05,433 INFO L87 Difference]: Start difference. First operand 62 states and 318 transitions. Second operand 8 states. [2019-03-04 16:26:15,584 WARN L181 SmtUtils]: Spent 9.76 s on a formula simplification. DAG size of input: 129 DAG size of output: 122 [2019-03-04 16:26:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:19,987 INFO L93 Difference]: Finished difference Result 110 states and 417 transitions. [2019-03-04 16:26:19,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:19,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:26:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:19,990 INFO L225 Difference]: With dead ends: 110 [2019-03-04 16:26:19,990 INFO L226 Difference]: Without dead ends: 109 [2019-03-04 16:26:19,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-03-04 16:26:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 62. [2019-03-04 16:26:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-03-04 16:26:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 318 transitions. [2019-03-04 16:26:20,011 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 318 transitions. Word has length 4 [2019-03-04 16:26:20,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:20,011 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 318 transitions. [2019-03-04 16:26:20,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 318 transitions. [2019-03-04 16:26:20,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:26:20,012 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:20,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:26:20,012 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:20,013 INFO L82 PathProgramCache]: Analyzing trace with hash 951266, now seen corresponding path program 2 times [2019-03-04 16:26:20,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:20,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:20,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:20,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:20,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:20,196 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-03-04 16:26:20,353 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-03-04 16:26:20,502 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:20,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:20,503 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:26:20,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:20,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:20,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:20,558 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:26:20,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:20,591 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 24 treesize of output 27 [2019-03-04 16:26:20,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,645 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 27 treesize of output 29 [2019-03-04 16:26:20,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,723 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 29 treesize of output 31 [2019-03-04 16:26:20,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,735 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:26:20,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:20,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,784 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:20,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:20,820 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:26:20,820 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:20,838 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:20,853 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:20,868 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:20,896 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:20,912 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:20,927 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,002 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:26:21,003 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,013 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,030 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,057 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,093 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,133 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,177 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,245 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:26:21,246 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-03-04 16:26:21,280 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:26:21,280 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,342 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:21,342 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-03-04 16:26:21,396 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 44 [2019-03-04 16:26:21,397 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:21,443 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:21,444 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:78 [2019-03-04 16:26:21,466 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:21,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:21,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:21,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:21,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:21,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:21,488 INFO L87 Difference]: Start difference. First operand 62 states and 318 transitions. Second operand 8 states. [2019-03-04 16:26:22,287 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-03-04 16:26:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:22,667 INFO L93 Difference]: Finished difference Result 116 states and 406 transitions. [2019-03-04 16:26:22,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:26:22,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:26:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:22,669 INFO L225 Difference]: With dead ends: 116 [2019-03-04 16:26:22,669 INFO L226 Difference]: Without dead ends: 112 [2019-03-04 16:26:22,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-03-04 16:26:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 66. [2019-03-04 16:26:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-03-04 16:26:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 304 transitions. [2019-03-04 16:26:22,691 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 304 transitions. Word has length 4 [2019-03-04 16:26:22,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:22,691 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 304 transitions. [2019-03-04 16:26:22,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 304 transitions. [2019-03-04 16:26:22,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:26:22,692 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:22,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:26:22,692 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:22,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:22,692 INFO L82 PathProgramCache]: Analyzing trace with hash 938000, now seen corresponding path program 1 times [2019-03-04 16:26:22,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:22,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:22,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:22,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:22,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:22,763 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:26:22,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:22,763 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:26:22,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:22,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:26:22,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:22,841 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:26:22,842 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,848 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,862 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,886 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,930 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:22,969 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,017 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:26:23,036 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:23,071 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:26:23,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:26:23,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:23,158 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:23,232 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:26:23,233 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,247 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,261 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,275 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,289 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,304 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,336 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,383 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:23,384 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:26:23,731 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-03-04 16:26:23,737 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:23,738 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:23,779 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:23,780 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-03-04 16:26:23,799 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:26:23,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:23,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:26:23,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:26:23,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:26:23,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:26:23,825 INFO L87 Difference]: Start difference. First operand 66 states and 304 transitions. Second operand 6 states. [2019-03-04 16:26:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:24,061 INFO L93 Difference]: Finished difference Result 89 states and 340 transitions. [2019-03-04 16:26:24,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:26:24,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:26:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:24,065 INFO L225 Difference]: With dead ends: 89 [2019-03-04 16:26:24,065 INFO L226 Difference]: Without dead ends: 88 [2019-03-04 16:26:24,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:26:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-03-04 16:26:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2019-03-04 16:26:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-03-04 16:26:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 312 transitions. [2019-03-04 16:26:24,084 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 312 transitions. Word has length 4 [2019-03-04 16:26:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:24,085 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 312 transitions. [2019-03-04 16:26:24,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:26:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 312 transitions. [2019-03-04 16:26:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:24,085 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:24,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:24,086 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash 29197230, now seen corresponding path program 1 times [2019-03-04 16:26:24,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:24,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:24,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:24,217 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:26:24,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:24,217 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:26:24,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:24,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:26:24,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:24,297 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 13 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:24,297 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,305 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,319 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,352 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,387 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,472 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 24 treesize of output 27 [2019-03-04 16:26:24,475 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 27 treesize of output 29 [2019-03-04 16:26:24,495 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 37 [2019-03-04 16:26:24,502 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:26:24,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, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:24,517 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:24,568 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:26:24,569 INFO L309 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,583 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,596 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,618 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,641 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,655 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,668 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,710 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:24,710 INFO L209 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:84, output treesize:88 [2019-03-04 16:26:24,795 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:24,795 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:24,832 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:24,833 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:93, output treesize:65 [2019-03-04 16:26:24,854 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:26:24,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:24,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2] total 5 [2019-03-04 16:26:24,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:26:24,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:26:24,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:26:24,873 INFO L87 Difference]: Start difference. First operand 67 states and 312 transitions. Second operand 7 states. [2019-03-04 16:26:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:25,192 INFO L93 Difference]: Finished difference Result 81 states and 333 transitions. [2019-03-04 16:26:25,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:26:25,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-03-04 16:26:25,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:25,193 INFO L225 Difference]: With dead ends: 81 [2019-03-04 16:26:25,193 INFO L226 Difference]: Without dead ends: 80 [2019-03-04 16:26:25,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:26:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-03-04 16:26:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2019-03-04 16:26:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-03-04 16:26:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 320 transitions. [2019-03-04 16:26:25,210 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 320 transitions. Word has length 5 [2019-03-04 16:26:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:25,210 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 320 transitions. [2019-03-04 16:26:25,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:26:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 320 transitions. [2019-03-04 16:26:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:25,211 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:25,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:25,211 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:25,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:25,211 INFO L82 PathProgramCache]: Analyzing trace with hash 29172180, now seen corresponding path program 1 times [2019-03-04 16:26:25,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:25,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:25,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:25,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:25,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:25,283 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:25,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:25,284 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:26:25,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:25,316 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:26:25,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:25,348 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 24 treesize of output 27 [2019-03-04 16:26:25,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,395 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:25,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,410 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 29 treesize of output 31 [2019-03-04 16:26:25,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,420 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 31 treesize of output 33 [2019-03-04 16:26:25,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,438 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:25,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,463 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:25,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:25,531 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:26:25,532 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,548 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,563 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,581 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,599 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,616 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,636 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,717 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:26:25,717 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,725 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,740 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,764 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,786 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:25,824 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,883 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:26:25,883 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:26:25,951 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:25,952 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:26,009 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:26,010 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:26:26,066 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:26:26,067 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:26,100 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:26,100 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-03-04 16:26:26,119 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:26,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:26,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:26,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:26,148 INFO L87 Difference]: Start difference. First operand 68 states and 320 transitions. Second operand 8 states. [2019-03-04 16:26:27,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:27,310 INFO L93 Difference]: Finished difference Result 107 states and 386 transitions. [2019-03-04 16:26:27,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:27,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:26:27,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:27,314 INFO L225 Difference]: With dead ends: 107 [2019-03-04 16:26:27,315 INFO L226 Difference]: Without dead ends: 106 [2019-03-04 16:26:27,315 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:26:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-03-04 16:26:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 72. [2019-03-04 16:26:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-03-04 16:26:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 352 transitions. [2019-03-04 16:26:27,333 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 352 transitions. Word has length 5 [2019-03-04 16:26:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:27,333 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 352 transitions. [2019-03-04 16:26:27,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 352 transitions. [2019-03-04 16:26:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:27,333 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:27,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:27,334 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:27,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:27,334 INFO L82 PathProgramCache]: Analyzing trace with hash 29187556, now seen corresponding path program 1 times [2019-03-04 16:26:27,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:27,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:27,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:27,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:27,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:27,552 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:27,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:27,552 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:26:27,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:27,567 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:26:27,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:26:27,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,577 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 27 treesize of output 29 [2019-03-04 16:26:27,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,585 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 29 treesize of output 31 [2019-03-04 16:26:27,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,597 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:26:27,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:27,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,639 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:27,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:27,707 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:26:27,707 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,724 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,739 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,754 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,769 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,785 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,801 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,872 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:26:27,872 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,878 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,888 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,902 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,924 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:27,957 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:28,011 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:26:28,012 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:26:28,058 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:28,059 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:28,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:26:28,119 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:26:28,153 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:26:28,154 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:28,183 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:28,184 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-03-04 16:26:28,205 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:28,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:28,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:28,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:28,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:28,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:28,223 INFO L87 Difference]: Start difference. First operand 72 states and 352 transitions. Second operand 8 states. [2019-03-04 16:26:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:28,599 INFO L93 Difference]: Finished difference Result 113 states and 421 transitions. [2019-03-04 16:26:28,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:28,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:26:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:28,601 INFO L225 Difference]: With dead ends: 113 [2019-03-04 16:26:28,601 INFO L226 Difference]: Without dead ends: 111 [2019-03-04 16:26:28,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-03-04 16:26:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 79. [2019-03-04 16:26:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-03-04 16:26:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 381 transitions. [2019-03-04 16:26:28,623 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 381 transitions. Word has length 5 [2019-03-04 16:26:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:28,623 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 381 transitions. [2019-03-04 16:26:28,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 381 transitions. [2019-03-04 16:26:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:28,624 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:28,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:28,624 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:28,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:28,624 INFO L82 PathProgramCache]: Analyzing trace with hash 29186872, now seen corresponding path program 1 times [2019-03-04 16:26:28,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:28,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:28,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:28,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:28,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:28,762 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:28,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:28,763 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:26:28,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:28,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:26:28,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:28,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 24 treesize of output 27 [2019-03-04 16:26:28,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,790 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 27 treesize of output 29 [2019-03-04 16:26:28,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:26:28,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,826 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:26:28,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,842 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:28,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,856 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,867 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:28,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:28,939 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:26:28,940 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:28,954 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:28,969 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:28,985 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:28,999 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,014 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,030 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,090 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:26:29,090 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,101 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,110 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,127 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,154 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,182 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,230 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:29,231 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:26:29,318 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:29,318 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,480 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:29,480 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:26:29,531 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:26:29,532 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,565 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:29,566 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:26:29,616 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:26:29,616 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:29,640 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:29,641 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:26:29,663 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:29,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:29,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:29,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:29,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:29,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:29,683 INFO L87 Difference]: Start difference. First operand 79 states and 381 transitions. Second operand 10 states. [2019-03-04 16:26:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:30,261 INFO L93 Difference]: Finished difference Result 130 states and 473 transitions. [2019-03-04 16:26:30,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:30,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:26:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:30,263 INFO L225 Difference]: With dead ends: 130 [2019-03-04 16:26:30,263 INFO L226 Difference]: Without dead ends: 129 [2019-03-04 16:26:30,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-03-04 16:26:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 83. [2019-03-04 16:26:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-03-04 16:26:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 413 transitions. [2019-03-04 16:26:30,287 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 413 transitions. Word has length 5 [2019-03-04 16:26:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:30,287 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 413 transitions. [2019-03-04 16:26:30,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 413 transitions. [2019-03-04 16:26:30,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:30,288 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:30,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:30,288 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:30,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:30,289 INFO L82 PathProgramCache]: Analyzing trace with hash 29187368, now seen corresponding path program 1 times [2019-03-04 16:26:30,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:30,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:30,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:30,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:30,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:30,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:30,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:30,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:30,480 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:26:30,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:30,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 24 treesize of output 27 [2019-03-04 16:26:30,496 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, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:30,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,504 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:26:30,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,516 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 31 treesize of output 33 [2019-03-04 16:26:30,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,534 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:30,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,561 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:30,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:30,628 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:26:30,628 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,643 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,660 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,674 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,696 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,713 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,735 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,812 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:26:30,813 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,827 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,843 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,868 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,897 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:30,931 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,984 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:30,984 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:26:31,064 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:31,065 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,116 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:31,116 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:26:31,158 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:26:31,158 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,188 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:31,189 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:26:31,255 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:26:31,256 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:31,281 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:31,281 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:26:31,303 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:31,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:31,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:31,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:31,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:31,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:31,324 INFO L87 Difference]: Start difference. First operand 83 states and 413 transitions. Second operand 10 states. [2019-03-04 16:26:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:31,863 INFO L93 Difference]: Finished difference Result 133 states and 503 transitions. [2019-03-04 16:26:31,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:31,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:26:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:31,865 INFO L225 Difference]: With dead ends: 133 [2019-03-04 16:26:31,865 INFO L226 Difference]: Without dead ends: 131 [2019-03-04 16:26:31,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-03-04 16:26:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 88. [2019-03-04 16:26:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-03-04 16:26:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 453 transitions. [2019-03-04 16:26:31,889 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 453 transitions. Word has length 5 [2019-03-04 16:26:31,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:31,890 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 453 transitions. [2019-03-04 16:26:31,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:31,890 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 453 transitions. [2019-03-04 16:26:31,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:31,890 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:31,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:31,891 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:31,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:31,891 INFO L82 PathProgramCache]: Analyzing trace with hash 29175836, now seen corresponding path program 1 times [2019-03-04 16:26:31,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:31,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:31,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:31,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:31,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:32,203 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-03-04 16:26:32,229 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:32,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:32,229 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:26:32,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:32,243 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:26:32,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:32,248 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 24 treesize of output 27 [2019-03-04 16:26:32,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,253 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 27 treesize of output 29 [2019-03-04 16:26:32,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,261 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 29 treesize of output 31 [2019-03-04 16:26:32,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,279 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 31 treesize of output 33 [2019-03-04 16:26:32,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,299 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:32,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,323 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:32,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:32,391 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:26:32,391 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,406 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,421 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,436 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,451 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,467 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,483 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,549 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:26:32,550 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,557 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,570 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,587 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,606 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,635 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,685 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:32,686 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:26:32,760 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:32,761 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,804 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:32,804 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:26:32,848 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:26:32,849 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,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:26:32,883 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:63 [2019-03-04 16:26:32,947 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 45 treesize of output 54 [2019-03-04 16:26:32,948 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:32,977 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:32,978 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:61 [2019-03-04 16:26:33,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:26:33,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:33,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:33,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:33,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:33,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:33,024 INFO L87 Difference]: Start difference. First operand 88 states and 453 transitions. Second operand 10 states. [2019-03-04 16:26:33,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:33,733 INFO L93 Difference]: Finished difference Result 130 states and 499 transitions. [2019-03-04 16:26:33,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:33,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:26:33,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:33,735 INFO L225 Difference]: With dead ends: 130 [2019-03-04 16:26:33,735 INFO L226 Difference]: Without dead ends: 128 [2019-03-04 16:26:33,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:26:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-03-04 16:26:33,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2019-03-04 16:26:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-03-04 16:26:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 444 transitions. [2019-03-04 16:26:33,767 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 444 transitions. Word has length 5 [2019-03-04 16:26:33,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:33,767 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 444 transitions. [2019-03-04 16:26:33,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 444 transitions. [2019-03-04 16:26:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:33,767 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:33,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:33,768 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:33,768 INFO L82 PathProgramCache]: Analyzing trace with hash 29175898, now seen corresponding path program 1 times [2019-03-04 16:26:33,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:33,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:33,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:33,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:33,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:33,944 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:26:33,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:33,958 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:26:33,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:33,963 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 24 treesize of output 27 [2019-03-04 16:26:33,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,968 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 27 treesize of output 29 [2019-03-04 16:26:33,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,975 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 29 treesize of output 31 [2019-03-04 16:26:33,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,988 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 31 treesize of output 33 [2019-03-04 16:26:33,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:33,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:34,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,026 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:34,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:34,093 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:26:34,094 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,110 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,126 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,142 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,157 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,172 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,187 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,436 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:26:34,437 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,557 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,729 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,811 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,838 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,866 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:34,915 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:34,915 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:26:34,957 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:26:34,958 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:35,034 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:35,035 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:152 [2019-03-04 16:26:35,225 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 97 [2019-03-04 16:26:35,227 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:35,435 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 83 treesize of output 85 [2019-03-04 16:26:35,436 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:35,549 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-03-04 16:26:35,550 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:195 [2019-03-04 16:26:35,721 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 26 case distinctions, treesize of input 78 treesize of output 111 [2019-03-04 16:26:35,726 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:26:36,178 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 73 treesize of output 96 [2019-03-04 16:26:36,179 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:36,377 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-03-04 16:26:36,378 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-03-04 16:26:36,641 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-03-04 16:26:36,642 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,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:36,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:36,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:36,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:36,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:36,662 INFO L87 Difference]: Start difference. First operand 87 states and 444 transitions. Second operand 10 states. [2019-03-04 16:26:37,082 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2019-03-04 16:26:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:41,347 INFO L93 Difference]: Finished difference Result 152 states and 637 transitions. [2019-03-04 16:26:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:41,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:26:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:41,350 INFO L225 Difference]: With dead ends: 152 [2019-03-04 16:26:41,350 INFO L226 Difference]: Without dead ends: 151 [2019-03-04 16:26:41,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-03-04 16:26:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 91. [2019-03-04 16:26:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-03-04 16:26:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 476 transitions. [2019-03-04 16:26:41,375 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 476 transitions. Word has length 5 [2019-03-04 16:26:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:41,376 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 476 transitions. [2019-03-04 16:26:41,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 476 transitions. [2019-03-04 16:26:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:41,376 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:41,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:41,376 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:41,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:41,377 INFO L82 PathProgramCache]: Analyzing trace with hash 29191274, now seen corresponding path program 1 times [2019-03-04 16:26:41,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:41,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:41,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:41,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:41,716 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-03-04 16:26:41,879 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-03-04 16:26:41,903 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:41,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:41,903 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:26:41,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:41,918 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:26:41,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:41,922 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 24 treesize of output 27 [2019-03-04 16:26:41,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:41,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,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 29 treesize of output 31 [2019-03-04 16:26:41,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,942 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,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 31 treesize of output 33 [2019-03-04 16:26:41,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:41,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,984 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:41,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:41,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:42,049 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:26:42,050 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,067 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,083 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,099 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,116 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,131 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,147 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,216 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:26:42,217 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,223 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,232 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,245 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,268 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,297 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,347 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:42,347 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:26:42,400 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:26:42,401 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:42,479 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:42,479 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:152 [2019-03-04 16:26:42,559 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 83 treesize of output 85 [2019-03-04 16:26:42,560 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:42,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 97 [2019-03-04 16:26:42,687 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-03-04 16:26:42,847 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-03-04 16:26:42,847 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:195 [2019-03-04 16:26:43,018 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 26 case distinctions, treesize of input 78 treesize of output 115 [2019-03-04 16:26:43,022 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-03-04 16:26:43,566 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 73 treesize of output 96 [2019-03-04 16:26:43,567 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:43,753 INFO L309 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-03-04 16:26:43,754 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-03-04 16:26:46,075 WARN L181 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-03-04 16:26:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:46,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:46,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:46,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:46,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:46,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:46,096 INFO L87 Difference]: Start difference. First operand 91 states and 476 transitions. Second operand 10 states. [2019-03-04 16:26:46,239 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-03-04 16:26:46,850 WARN L181 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2019-03-04 16:26:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:48,227 INFO L93 Difference]: Finished difference Result 153 states and 664 transitions. [2019-03-04 16:26:48,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:26:48,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:26:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:48,229 INFO L225 Difference]: With dead ends: 153 [2019-03-04 16:26:48,229 INFO L226 Difference]: Without dead ends: 152 [2019-03-04 16:26:48,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:48,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-03-04 16:26:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 93. [2019-03-04 16:26:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-03-04 16:26:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 492 transitions. [2019-03-04 16:26:48,267 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 492 transitions. Word has length 5 [2019-03-04 16:26:48,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:48,267 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 492 transitions. [2019-03-04 16:26:48,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 492 transitions. [2019-03-04 16:26:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:48,268 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:48,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:48,268 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:48,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:48,268 INFO L82 PathProgramCache]: Analyzing trace with hash 29193322, now seen corresponding path program 1 times [2019-03-04 16:26:48,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:48,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:48,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:48,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:48,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:48,423 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:48,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:48,423 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:26:48,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:48,439 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:26:48,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:48,486 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:26:48,486 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,491 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,503 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,519 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,548 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,579 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,625 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,680 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:26:48,684 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:48,689 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:26:48,693 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:26:48,698 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:48,703 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:48,707 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:26:48,708 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,721 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,736 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,750 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,765 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,779 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,794 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,859 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:26:48,859 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-03-04 16:26:48,887 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:26:48,887 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:48,950 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:48,951 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:26:48,988 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 46 [2019-03-04 16:26:48,988 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:49,032 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:49,032 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-03-04 16:26:49,060 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:49,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:49,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:49,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:49,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:49,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:49,079 INFO L87 Difference]: Start difference. First operand 93 states and 492 transitions. Second operand 8 states. [2019-03-04 16:26:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:49,649 INFO L93 Difference]: Finished difference Result 132 states and 559 transitions. [2019-03-04 16:26:49,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:49,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:26:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:49,651 INFO L225 Difference]: With dead ends: 132 [2019-03-04 16:26:49,651 INFO L226 Difference]: Without dead ends: 127 [2019-03-04 16:26:49,652 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:26:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-03-04 16:26:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 95. [2019-03-04 16:26:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-03-04 16:26:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 514 transitions. [2019-03-04 16:26:49,692 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 514 transitions. Word has length 5 [2019-03-04 16:26:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:49,692 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 514 transitions. [2019-03-04 16:26:49,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 514 transitions. [2019-03-04 16:26:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:49,693 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:49,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:49,693 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:49,694 INFO L82 PathProgramCache]: Analyzing trace with hash 29192638, now seen corresponding path program 2 times [2019-03-04 16:26:49,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:49,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:49,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:49,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:49,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:49,850 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:49,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:49,850 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:26:49,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:49,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:49,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:49,867 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-03-04 16:26:49,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:49,874 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 24 treesize of output 27 [2019-03-04 16:26:49,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,880 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 27 treesize of output 29 [2019-03-04 16:26:49,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,890 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:26:49,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,903 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 31 treesize of output 33 [2019-03-04 16:26:49,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,941 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:49,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,969 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:49,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:49,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:50,002 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:26:50,003 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,018 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,035 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,052 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,065 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,082 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,098 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,174 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:26:50,175 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,180 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,192 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,217 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,248 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,289 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,332 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,399 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:50,400 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-03-04 16:26:50,438 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:26:50,438 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,501 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:50,501 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:98 [2019-03-04 16:26:50,577 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 50 [2019-03-04 16:26:50,578 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,625 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:50,625 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-03-04 16:26:50,683 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 48 treesize of output 53 [2019-03-04 16:26:50,684 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:50,721 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:50,721 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:68 [2019-03-04 16:26:50,747 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:50,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:50,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:50,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:50,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:50,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:50,768 INFO L87 Difference]: Start difference. First operand 95 states and 514 transitions. Second operand 10 states. [2019-03-04 16:26:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:51,643 INFO L93 Difference]: Finished difference Result 147 states and 622 transitions. [2019-03-04 16:26:51,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:51,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:26:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:51,646 INFO L225 Difference]: With dead ends: 147 [2019-03-04 16:26:51,646 INFO L226 Difference]: Without dead ends: 146 [2019-03-04 16:26:51,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:51,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-03-04 16:26:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 101. [2019-03-04 16:26:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-03-04 16:26:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 562 transitions. [2019-03-04 16:26:51,688 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 562 transitions. Word has length 5 [2019-03-04 16:26:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:51,688 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 562 transitions. [2019-03-04 16:26:51,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 562 transitions. [2019-03-04 16:26:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:51,689 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:51,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:51,689 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:51,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:51,690 INFO L82 PathProgramCache]: Analyzing trace with hash 29193134, now seen corresponding path program 2 times [2019-03-04 16:26:51,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:51,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:51,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:51,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:51,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:51,841 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-03-04 16:26:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:52,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:52,229 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:26:52,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:26:52,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:26:52,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:26:52,293 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-03-04 16:26:52,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:52,328 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 24 treesize of output 27 [2019-03-04 16:26:52,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:52,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,482 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 29 treesize of output 31 [2019-03-04 16:26:52,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,615 INFO L301 Elim1Store]: Index analysis took 108 ms [2019-03-04 16:26:52,616 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 31 treesize of output 33 [2019-03-04 16:26:52,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,868 INFO L301 Elim1Store]: Index analysis took 227 ms [2019-03-04 16:26:52,869 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:52,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:52,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,139 INFO L301 Elim1Store]: Index analysis took 244 ms [2019-03-04 16:26:53,140 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:53,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:53,172 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:26:53,172 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,189 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,202 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,220 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,238 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,254 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,364 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,441 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:26:53,442 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,452 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,463 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,482 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,507 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,546 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,590 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,656 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:53,657 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-03-04 16:26:53,695 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:26:53,696 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,762 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:53,763 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:98 [2019-03-04 16:26:53,818 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 50 [2019-03-04 16:26:53,819 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,868 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:53,868 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-03-04 16:26:53,931 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 48 treesize of output 53 [2019-03-04 16:26:53,932 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:53,968 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:53,968 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:68 [2019-03-04 16:26:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:54,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:54,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:54,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:54,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:54,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:54,016 INFO L87 Difference]: Start difference. First operand 101 states and 562 transitions. Second operand 10 states. [2019-03-04 16:26:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:54,772 INFO L93 Difference]: Finished difference Result 153 states and 670 transitions. [2019-03-04 16:26:54,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:54,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:26:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:54,775 INFO L225 Difference]: With dead ends: 153 [2019-03-04 16:26:54,775 INFO L226 Difference]: Without dead ends: 151 [2019-03-04 16:26:54,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-03-04 16:26:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 108. [2019-03-04 16:26:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:26:54,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 618 transitions. [2019-03-04 16:26:54,813 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 618 transitions. Word has length 5 [2019-03-04 16:26:54,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:54,813 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 618 transitions. [2019-03-04 16:26:54,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:54,813 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 618 transitions. [2019-03-04 16:26:54,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:54,814 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:54,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:54,814 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:54,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:54,814 INFO L82 PathProgramCache]: Analyzing trace with hash 29179868, now seen corresponding path program 1 times [2019-03-04 16:26:54,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:54,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:54,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:54,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:26:54,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:55,155 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-03-04 16:26:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:55,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:55,257 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:26:55,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:55,276 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:26:55,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:55,334 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:26:55,335 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,349 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,376 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,405 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,440 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,479 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,526 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:26:55,560 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:26:55,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:26:55,587 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:26:55,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:55,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:55,640 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:26:55,641 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,656 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,669 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,684 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,696 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,710 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,722 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,771 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:26:55,771 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:26:55,820 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:55,820 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,861 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:55,862 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:26:55,902 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:26:55,903 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:55,936 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:55,936 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-03-04 16:26:55,957 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:55,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:55,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:26:55,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:26:55,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:26:55,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:26:55,978 INFO L87 Difference]: Start difference. First operand 108 states and 618 transitions. Second operand 8 states. [2019-03-04 16:26:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:56,385 INFO L93 Difference]: Finished difference Result 139 states and 676 transitions. [2019-03-04 16:26:56,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:26:56,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:26:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:56,388 INFO L225 Difference]: With dead ends: 139 [2019-03-04 16:26:56,388 INFO L226 Difference]: Without dead ends: 138 [2019-03-04 16:26:56,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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:26:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-03-04 16:26:56,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 111. [2019-03-04 16:26:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-03-04 16:26:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 642 transitions. [2019-03-04 16:26:56,421 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 642 transitions. Word has length 5 [2019-03-04 16:26:56,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:56,421 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 642 transitions. [2019-03-04 16:26:56,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:26:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 642 transitions. [2019-03-04 16:26:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:56,422 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:56,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:56,422 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:56,423 INFO L82 PathProgramCache]: Analyzing trace with hash 29179184, now seen corresponding path program 1 times [2019-03-04 16:26:56,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:56,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:56,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:56,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:56,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:56,589 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-03-04 16:26:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:56,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:56,628 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:26:56,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:56,650 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:26:56,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:56,657 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:26:56,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,662 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 27 treesize of output 29 [2019-03-04 16:26:56,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,675 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 29 treesize of output 31 [2019-03-04 16:26:56,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,691 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 31 treesize of output 33 [2019-03-04 16:26:56,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,717 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:56,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,740 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:56,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:56,870 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:26:56,871 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,886 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,902 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,918 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,934 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,950 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:56,965 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:57,025 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:26:57,026 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:57,031 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:57,038 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:57,049 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:57,070 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:57,098 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:57,146 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:57,147 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:26:57,208 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:57,208 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:57,252 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:57,253 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:26:57,296 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:26:57,296 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:57,328 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:57,328 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:26:57,387 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:26:57,388 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:57,413 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:57,413 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:26:57,435 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:57,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:57,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:57,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:57,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:57,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:57,455 INFO L87 Difference]: Start difference. First operand 111 states and 642 transitions. Second operand 10 states. [2019-03-04 16:26:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:26:58,176 INFO L93 Difference]: Finished difference Result 161 states and 748 transitions. [2019-03-04 16:26:58,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:26:58,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:26:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:26:58,179 INFO L225 Difference]: With dead ends: 161 [2019-03-04 16:26:58,179 INFO L226 Difference]: Without dead ends: 160 [2019-03-04 16:26:58,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:26:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-03-04 16:26:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 117. [2019-03-04 16:26:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-03-04 16:26:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 690 transitions. [2019-03-04 16:26:58,252 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 690 transitions. Word has length 5 [2019-03-04 16:26:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:26:58,253 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 690 transitions. [2019-03-04 16:26:58,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:26:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 690 transitions. [2019-03-04 16:26:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:26:58,253 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:26:58,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:26:58,254 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:26:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:26:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 29179680, now seen corresponding path program 1 times [2019-03-04 16:26:58,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:26:58,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:26:58,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:58,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:58,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:26:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:58,598 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-03-04 16:26:58,649 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:58,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:26:58,650 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:26:58,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:26:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:26:58,665 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:26:58,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:26:58,674 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 24 treesize of output 27 [2019-03-04 16:26:58,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,680 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 27 treesize of output 29 [2019-03-04 16:26:58,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,690 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 29 treesize of output 31 [2019-03-04 16:26:58,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,702 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 31 treesize of output 33 [2019-03-04 16:26:58,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,719 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:26:58,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,742 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:26:58,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,756 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 L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:26:58,807 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:26:58,808 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,823 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,839 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,855 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,870 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,883 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,898 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,959 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:26:58,960 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,963 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,976 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:58,997 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,024 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,053 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,102 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:59,103 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:26:59,166 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:26:59,166 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,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:26:59,211 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:73 [2019-03-04 16:26:59,252 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:26:59,253 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,285 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:59,285 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:26:59,339 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:26:59,340 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:26:59,366 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:26:59,366 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:26:59,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:26:59,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:26:59,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:26:59,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:26:59,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:26:59,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:26:59,407 INFO L87 Difference]: Start difference. First operand 117 states and 690 transitions. Second operand 10 states. [2019-03-04 16:27:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:00,065 INFO L93 Difference]: Finished difference Result 164 states and 791 transitions. [2019-03-04 16:27:00,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:27:00,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:27:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:00,067 INFO L225 Difference]: With dead ends: 164 [2019-03-04 16:27:00,067 INFO L226 Difference]: Without dead ends: 162 [2019-03-04 16:27:00,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:27:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-03-04 16:27:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 124. [2019-03-04 16:27:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-03-04 16:27:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 746 transitions. [2019-03-04 16:27:00,116 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 746 transitions. Word has length 5 [2019-03-04 16:27:00,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:00,116 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 746 transitions. [2019-03-04 16:27:00,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:27:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 746 transitions. [2019-03-04 16:27:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:00,116 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:00,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:00,117 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:00,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:00,117 INFO L82 PathProgramCache]: Analyzing trace with hash 28825536, now seen corresponding path program 1 times [2019-03-04 16:27:00,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:00,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:00,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:00,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:00,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:00,198 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:00,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:00,198 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:27:00,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:00,213 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:27:00,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:00,220 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 24 treesize of output 27 [2019-03-04 16:27:00,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,226 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 27 treesize of output 29 [2019-03-04 16:27:00,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,235 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:27:00,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,256 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 31 treesize of output 33 [2019-03-04 16:27:00,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:00,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,296 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:00,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:00,363 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:27:00,364 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,378 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,394 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,409 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,425 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,440 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,455 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,517 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:27:00,518 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,526 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,538 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,558 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,585 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,614 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,662 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:27:00,662 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:27:00,713 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:00,713 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,756 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:00,757 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:27:00,794 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:27:00,794 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,831 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:00,832 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:27:00,881 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:27:00,882 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:00,926 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:00,926 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:27:00,945 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:00,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:00,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:27:00,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:27:00,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:27:00,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:00,966 INFO L87 Difference]: Start difference. First operand 124 states and 746 transitions. Second operand 10 states. [2019-03-04 16:27:02,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:02,640 INFO L93 Difference]: Finished difference Result 203 states and 930 transitions. [2019-03-04 16:27:02,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:27:02,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:27:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:02,643 INFO L225 Difference]: With dead ends: 203 [2019-03-04 16:27:02,643 INFO L226 Difference]: Without dead ends: 201 [2019-03-04 16:27:02,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-03-04 16:27:02,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 133. [2019-03-04 16:27:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-03-04 16:27:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 797 transitions. [2019-03-04 16:27:02,706 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 797 transitions. Word has length 5 [2019-03-04 16:27:02,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:02,706 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 797 transitions. [2019-03-04 16:27:02,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:27:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 797 transitions. [2019-03-04 16:27:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:02,707 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:02,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:02,708 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:02,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:02,708 INFO L82 PathProgramCache]: Analyzing trace with hash 28826032, now seen corresponding path program 1 times [2019-03-04 16:27:02,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:02,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:02,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:02,864 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:02,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:02,864 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:27:02,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:02,878 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:27:02,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:02,888 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 24 treesize of output 27 [2019-03-04 16:27:02,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,898 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 27 treesize of output 29 [2019-03-04 16:27:02,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,907 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 29 treesize of output 31 [2019-03-04 16:27:02,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,921 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:27:02,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,939 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:02,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,963 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:02,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:02,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:03,029 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:27:03,030 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,045 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,058 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,074 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,090 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,103 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,120 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,177 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:27:03,177 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,186 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,202 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,220 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,242 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,271 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,318 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:27:03,319 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:27:03,362 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:03,362 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,406 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:03,407 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:27:03,445 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:27:03,445 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,479 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:03,480 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:27:03,548 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:27:03,548 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:03,571 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:03,571 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:27:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:03,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:03,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:27:03,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:27:03,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:27:03,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:03,611 INFO L87 Difference]: Start difference. First operand 133 states and 797 transitions. Second operand 10 states. [2019-03-04 16:27:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:05,417 INFO L93 Difference]: Finished difference Result 251 states and 1248 transitions. [2019-03-04 16:27:05,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:27:05,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:27:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:05,420 INFO L225 Difference]: With dead ends: 251 [2019-03-04 16:27:05,420 INFO L226 Difference]: Without dead ends: 249 [2019-03-04 16:27:05,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:27:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-03-04 16:27:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 161. [2019-03-04 16:27:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-03-04 16:27:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 1042 transitions. [2019-03-04 16:27:05,483 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 1042 transitions. Word has length 5 [2019-03-04 16:27:05,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:05,483 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 1042 transitions. [2019-03-04 16:27:05,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:27:05,483 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 1042 transitions. [2019-03-04 16:27:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:05,484 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:05,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:05,484 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:05,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:05,484 INFO L82 PathProgramCache]: Analyzing trace with hash 28830064, now seen corresponding path program 1 times [2019-03-04 16:27:05,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:05,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:05,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:05,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:05,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:05,715 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:05,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:05,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 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:27:05,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:05,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:27:05,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:05,760 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:27:05,761 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,763 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,773 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,792 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,818 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,849 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,888 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:27:05,892 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:05,896 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:27:05,903 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:27:05,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:05,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:05,958 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:27:05,959 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,972 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:05,987 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,001 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,015 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,030 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,044 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,093 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:27:06,093 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:27:06,145 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:06,146 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,190 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:06,190 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:27:06,229 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:27:06,229 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,262 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:06,262 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-03-04 16:27:06,284 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:06,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:06,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:06,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:06,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:06,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:06,303 INFO L87 Difference]: Start difference. First operand 161 states and 1042 transitions. Second operand 8 states. [2019-03-04 16:27:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:06,685 INFO L93 Difference]: Finished difference Result 196 states and 1097 transitions. [2019-03-04 16:27:06,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:27:06,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:27:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:06,688 INFO L225 Difference]: With dead ends: 196 [2019-03-04 16:27:06,688 INFO L226 Difference]: Without dead ends: 194 [2019-03-04 16:27:06,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-03-04 16:27:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 167. [2019-03-04 16:27:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-03-04 16:27:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 1062 transitions. [2019-03-04 16:27:06,747 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 1062 transitions. Word has length 5 [2019-03-04 16:27:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:06,747 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 1062 transitions. [2019-03-04 16:27:06,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 1062 transitions. [2019-03-04 16:27:06,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:06,748 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:06,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:06,749 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:06,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:06,749 INFO L82 PathProgramCache]: Analyzing trace with hash 28818532, now seen corresponding path program 1 times [2019-03-04 16:27:06,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:06,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:06,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:06,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:06,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:06,800 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:06,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:06,800 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:27:06,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:06,825 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:27:06,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:06,873 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:27:06,873 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,882 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,896 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,913 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,939 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:06,967 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,004 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:27:07,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, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:07,012 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:27:07,016 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:27:07,022 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:07,025 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:07,070 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:27:07,071 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,085 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,099 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,113 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,126 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,141 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,155 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,247 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:07,247 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:27:07,284 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:07,284 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,328 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:07,328 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-03-04 16:27:07,362 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:27:07,363 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:07,393 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:07,394 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:27:07,413 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:07,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:07,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:07,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:07,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:07,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:07,433 INFO L87 Difference]: Start difference. First operand 167 states and 1062 transitions. Second operand 8 states. [2019-03-04 16:27:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:07,789 INFO L93 Difference]: Finished difference Result 213 states and 1232 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 8 states. Word has length 5 [2019-03-04 16:27:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:07,793 INFO L225 Difference]: With dead ends: 213 [2019-03-04 16:27:07,793 INFO L226 Difference]: Without dead ends: 212 [2019-03-04 16:27:07,793 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:27:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-03-04 16:27:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 185. [2019-03-04 16:27:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-03-04 16:27:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1207 transitions. [2019-03-04 16:27:07,891 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1207 transitions. Word has length 5 [2019-03-04 16:27:07,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:07,891 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1207 transitions. [2019-03-04 16:27:07,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1207 transitions. [2019-03-04 16:27:07,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:07,892 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:07,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:07,893 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:07,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:07,893 INFO L82 PathProgramCache]: Analyzing trace with hash 28835830, now seen corresponding path program 1 times [2019-03-04 16:27:07,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:07,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:07,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:07,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:07,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:08,049 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-03-04 16:27:08,061 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:08,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:08,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 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:27:08,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:08,076 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:27:08,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:08,082 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:27:08,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,086 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:08,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,095 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 29 treesize of output 31 [2019-03-04 16:27:08,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,108 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 31 treesize of output 33 [2019-03-04 16:27:08,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:08,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,154 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:08,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:08,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:27:08,191 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,224 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,239 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,254 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,268 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,285 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,302 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,376 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:27:08,376 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,378 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,384 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,400 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,427 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,460 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,503 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,570 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:27:08,570 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-03-04 16:27:08,598 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:27:08,598 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,662 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:08,662 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-03-04 16:27:08,705 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:27:08,705 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:08,751 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:08,751 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-03-04 16:27:08,775 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:08,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:08,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:08,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:08,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:08,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:08,794 INFO L87 Difference]: Start difference. First operand 185 states and 1207 transitions. Second operand 8 states. [2019-03-04 16:27:09,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:09,428 INFO L93 Difference]: Finished difference Result 218 states and 1261 transitions. [2019-03-04 16:27:09,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:27:09,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:27:09,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:09,432 INFO L225 Difference]: With dead ends: 218 [2019-03-04 16:27:09,432 INFO L226 Difference]: Without dead ends: 210 [2019-03-04 16:27:09,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-03-04 16:27:09,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 183. [2019-03-04 16:27:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-03-04 16:27:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 1218 transitions. [2019-03-04 16:27:09,507 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 1218 transitions. Word has length 5 [2019-03-04 16:27:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:09,507 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 1218 transitions. [2019-03-04 16:27:09,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 1218 transitions. [2019-03-04 16:27:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:09,508 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:09,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:09,508 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:09,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:09,508 INFO L82 PathProgramCache]: Analyzing trace with hash 28822376, now seen corresponding path program 1 times [2019-03-04 16:27:09,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:09,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:09,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:09,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:09,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:09,572 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:09,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:09,573 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:27:09,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:09,586 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:27:09,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:09,593 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 24 treesize of output 27 [2019-03-04 16:27:09,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:09,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,612 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 29 treesize of output 31 [2019-03-04 16:27:09,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,631 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 31 treesize of output 33 [2019-03-04 16:27:09,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:09,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,670 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:09,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:09,752 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:27:09,753 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,790 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,806 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,819 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,835 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,848 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,863 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,920 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:27:09,920 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,926 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,936 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,953 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:09,979 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,007 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,054 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:27:10,055 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:27:10,104 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:10,105 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,146 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:10,146 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:27:10,187 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:27:10,188 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:10,220 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:10,220 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-03-04 16:27:10,241 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:10,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:10,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:10,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:10,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:10,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:10,261 INFO L87 Difference]: Start difference. First operand 183 states and 1218 transitions. Second operand 8 states. [2019-03-04 16:27:10,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:10,735 INFO L93 Difference]: Finished difference Result 208 states and 1263 transitions. [2019-03-04 16:27:10,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:27:10,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:27:10,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:10,738 INFO L225 Difference]: With dead ends: 208 [2019-03-04 16:27:10,739 INFO L226 Difference]: Without dead ends: 207 [2019-03-04 16:27:10,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-03-04 16:27:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 185. [2019-03-04 16:27:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-03-04 16:27:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1234 transitions. [2019-03-04 16:27:10,811 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1234 transitions. Word has length 5 [2019-03-04 16:27:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:10,812 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1234 transitions. [2019-03-04 16:27:10,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1234 transitions. [2019-03-04 16:27:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:10,813 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:10,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:10,813 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:10,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:10,813 INFO L82 PathProgramCache]: Analyzing trace with hash 29295188, now seen corresponding path program 1 times [2019-03-04 16:27:10,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:10,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:10,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:10,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:10,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:10,930 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:27:10,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:10,931 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:27:10,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:10,946 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:27:10,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:11,026 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:27:11,027 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,031 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,037 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,051 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,069 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,097 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,136 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:27:11,139 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:11,143 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:27:11,147 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:27:11,151 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:11,155 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:11,206 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:27:11,207 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,219 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,234 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,248 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,262 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,277 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,291 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,338 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:11,339 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:27:11,372 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:11,372 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,415 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:11,416 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-03-04 16:27:11,451 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 39 [2019-03-04 16:27:11,452 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:11,484 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:11,485 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:27:11,501 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:11,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:11,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:11,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:11,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:11,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:11,521 INFO L87 Difference]: Start difference. First operand 185 states and 1234 transitions. Second operand 8 states. [2019-03-04 16:27:11,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:11,908 INFO L93 Difference]: Finished difference Result 334 states and 2241 transitions. [2019-03-04 16:27:11,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:27:11,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:27:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:11,912 INFO L225 Difference]: With dead ends: 334 [2019-03-04 16:27:11,912 INFO L226 Difference]: Without dead ends: 333 [2019-03-04 16:27:11,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:11,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-03-04 16:27:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 303. [2019-03-04 16:27:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-03-04 16:27:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 2183 transitions. [2019-03-04 16:27:12,018 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 2183 transitions. Word has length 5 [2019-03-04 16:27:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:12,018 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 2183 transitions. [2019-03-04 16:27:12,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 2183 transitions. [2019-03-04 16:27:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:12,019 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:12,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:12,019 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash 29295000, now seen corresponding path program 1 times [2019-03-04 16:27:12,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:12,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:12,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:12,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:12,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:12,105 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:12,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:12,105 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:27:12,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:12,135 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:27:12,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:12,197 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:27:12,198 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,209 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,222 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,239 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,267 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,310 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,357 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:27:12,360 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:12,364 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:27:12,368 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:27:12,372 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:12,383 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:12,430 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:27:12,431 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,446 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,463 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,479 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,495 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,521 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,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:12,584 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:12,585 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:27:12,660 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:12,660 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,703 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:12,704 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-03-04 16:27:12,749 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:27:12,750 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,783 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:12,784 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:57 [2019-03-04 16:27:12,840 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 48 [2019-03-04 16:27:12,841 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:12,864 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:12,865 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:27:12,885 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:12,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:12,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:27:12,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:27:12,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:27:12,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:12,904 INFO L87 Difference]: Start difference. First operand 303 states and 2183 transitions. Second operand 10 states. [2019-03-04 16:27:14,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:14,588 INFO L93 Difference]: Finished difference Result 356 states and 2273 transitions. [2019-03-04 16:27:14,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:27:14,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:27:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:14,593 INFO L225 Difference]: With dead ends: 356 [2019-03-04 16:27:14,593 INFO L226 Difference]: Without dead ends: 354 [2019-03-04 16:27:14,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:27:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-03-04 16:27:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 307. [2019-03-04 16:27:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-03-04 16:27:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 2215 transitions. [2019-03-04 16:27:14,696 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 2215 transitions. Word has length 5 [2019-03-04 16:27:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:14,697 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 2215 transitions. [2019-03-04 16:27:14,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:27:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 2215 transitions. [2019-03-04 16:27:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:14,698 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:14,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:14,698 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:14,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:14,699 INFO L82 PathProgramCache]: Analyzing trace with hash 29312486, now seen corresponding path program 1 times [2019-03-04 16:27:14,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:14,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:14,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:14,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:14,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:14,905 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-03-04 16:27:14,916 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:14,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:14,917 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:27:14,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:14,933 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:27:14,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:14,974 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:27:14,975 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:14,982 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,001 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,031 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,066 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,104 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,149 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,199 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:27:15,203 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:15,206 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:27:15,210 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:27:15,213 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:15,217 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:15,221 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:27:15,222 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,236 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,250 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,263 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,277 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,291 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,306 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,373 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:27:15,373 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-03-04 16:27:15,398 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:27:15,398 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,462 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:15,463 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-03-04 16:27:15,514 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:27:15,515 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:15,560 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:15,560 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-03-04 16:27:15,592 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:15,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:15,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:15,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:15,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:15,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:15,612 INFO L87 Difference]: Start difference. First operand 307 states and 2215 transitions. Second operand 8 states. [2019-03-04 16:27:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:16,161 INFO L93 Difference]: Finished difference Result 341 states and 2263 transitions. [2019-03-04 16:27:16,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:27:16,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:27:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:16,166 INFO L225 Difference]: With dead ends: 341 [2019-03-04 16:27:16,166 INFO L226 Difference]: Without dead ends: 337 [2019-03-04 16:27:16,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:16,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-03-04 16:27:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 310. [2019-03-04 16:27:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-03-04 16:27:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 2232 transitions. [2019-03-04 16:27:16,283 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 2232 transitions. Word has length 5 [2019-03-04 16:27:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:16,283 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 2232 transitions. [2019-03-04 16:27:16,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:16,283 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 2232 transitions. [2019-03-04 16:27:16,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:16,284 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:16,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:16,284 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:16,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:16,284 INFO L82 PathProgramCache]: Analyzing trace with hash 29299032, now seen corresponding path program 1 times [2019-03-04 16:27:16,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:16,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:16,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:16,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:16,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:16,355 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:16,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:16,355 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:27:16,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:16,371 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:27:16,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:16,381 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 24 treesize of output 27 [2019-03-04 16:27:16,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,389 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 27 treesize of output 29 [2019-03-04 16:27:16,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,398 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 29 treesize of output 31 [2019-03-04 16:27:16,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,410 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:27:16,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:16,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,452 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:16,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:16,554 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:27:16,554 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,569 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,585 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,601 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,616 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,632 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,647 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,708 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:27:16,709 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,718 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,729 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,748 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,772 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,807 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,874 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:27:16,875 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:27:16,940 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:16,940 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:16,990 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:16,990 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:27:17,028 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:27:17,029 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,062 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:17,062 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-03-04 16:27:17,081 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:17,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:17,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:17,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:17,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:17,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:17,100 INFO L87 Difference]: Start difference. First operand 310 states and 2232 transitions. Second operand 8 states. [2019-03-04 16:27:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:17,590 INFO L93 Difference]: Finished difference Result 334 states and 2261 transitions. [2019-03-04 16:27:17,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:27:17,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:27:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:17,595 INFO L225 Difference]: With dead ends: 334 [2019-03-04 16:27:17,596 INFO L226 Difference]: Without dead ends: 333 [2019-03-04 16:27:17,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:27:17,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-03-04 16:27:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 311. [2019-03-04 16:27:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-03-04 16:27:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 2240 transitions. [2019-03-04 16:27:17,701 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 2240 transitions. Word has length 5 [2019-03-04 16:27:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:17,701 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 2240 transitions. [2019-03-04 16:27:17,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 2240 transitions. [2019-03-04 16:27:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:17,702 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:17,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:17,703 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:17,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:17,703 INFO L82 PathProgramCache]: Analyzing trace with hash 28958902, now seen corresponding path program 1 times [2019-03-04 16:27:17,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:17,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:17,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:17,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:17,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:17,763 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:27:17,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:17,763 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:27:17,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:17,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:27:17,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:17,784 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 24 treesize of output 27 [2019-03-04 16:27:17,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,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 27 treesize of output 29 [2019-03-04 16:27:17,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,803 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 29 treesize of output 31 [2019-03-04 16:27:17,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,819 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 31 treesize of output 33 [2019-03-04 16:27:17,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,837 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:17,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:17,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:17,930 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:27:17,931 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,946 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,962 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,978 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:17,995 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,009 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,022 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,082 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:27:18,083 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,091 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,102 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,119 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,146 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,175 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,223 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:18,223 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:27:18,269 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:18,269 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,318 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:18,318 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:27:18,338 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:27:18,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:18,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:27:18,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:27:18,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:27:18,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:27:18,358 INFO L87 Difference]: Start difference. First operand 311 states and 2240 transitions. Second operand 6 states. [2019-03-04 16:27:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:18,696 INFO L93 Difference]: Finished difference Result 331 states and 2259 transitions. [2019-03-04 16:27:18,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:27:18,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:27:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:18,701 INFO L225 Difference]: With dead ends: 331 [2019-03-04 16:27:18,702 INFO L226 Difference]: Without dead ends: 330 [2019-03-04 16:27:18,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:27:18,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-03-04 16:27:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 311. [2019-03-04 16:27:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-03-04 16:27:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 2240 transitions. [2019-03-04 16:27:18,826 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 2240 transitions. Word has length 5 [2019-03-04 16:27:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:18,826 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 2240 transitions. [2019-03-04 16:27:18,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:27:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 2240 transitions. [2019-03-04 16:27:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:18,827 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:18,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:18,828 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:18,828 INFO L82 PathProgramCache]: Analyzing trace with hash 28933852, now seen corresponding path program 2 times [2019-03-04 16:27:18,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:18,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:18,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:18,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:18,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:18,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:18,877 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:27:18,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:27:18,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:27:18,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:27:18,891 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:27:18,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:18,942 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-03-04 16:27:18,942 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,948 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,962 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:18,982 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,011 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,042 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,087 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:27:19,147 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:19,152 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-03-04 16:27:19,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, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2019-03-04 16:27:19,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, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:19,164 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:19,169 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-03-04 16:27:19,169 INFO L309 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,184 INFO L309 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,198 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,212 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,227 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,241 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,255 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,323 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:19,323 INFO L209 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:118, output treesize:120 [2019-03-04 16:27:19,346 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-03-04 16:27:19,347 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,409 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:19,410 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:98 [2019-03-04 16:27:19,444 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 46 [2019-03-04 16:27:19,445 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:19,491 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:19,491 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-03-04 16:27:19,511 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,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:19,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:27:19,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:27:19,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:27:19,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:27:19,532 INFO L87 Difference]: Start difference. First operand 311 states and 2240 transitions. Second operand 8 states. [2019-03-04 16:27:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:20,735 INFO L93 Difference]: Finished difference Result 422 states and 2777 transitions. [2019-03-04 16:27:20,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:27:20,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:27:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:20,740 INFO L225 Difference]: With dead ends: 422 [2019-03-04 16:27:20,740 INFO L226 Difference]: Without dead ends: 421 [2019-03-04 16:27:20,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:27:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-03-04 16:27:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 343. [2019-03-04 16:27:20,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-03-04 16:27:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 2501 transitions. [2019-03-04 16:27:20,860 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 2501 transitions. Word has length 5 [2019-03-04 16:27:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:20,861 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 2501 transitions. [2019-03-04 16:27:20,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:27:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 2501 transitions. [2019-03-04 16:27:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:20,861 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:20,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:20,862 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:20,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:20,862 INFO L82 PathProgramCache]: Analyzing trace with hash 28933664, now seen corresponding path program 1 times [2019-03-04 16:27:20,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:20,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:20,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:20,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:27:20,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:21,189 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2019-03-04 16:27:21,229 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:21,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:21,229 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:27:21,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:21,243 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:27:21,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:21,249 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:27:21,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,270 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 27 treesize of output 29 [2019-03-04 16:27:21,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,277 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 29 treesize of output 31 [2019-03-04 16:27:21,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,287 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 31 treesize of output 33 [2019-03-04 16:27:21,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,335 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:21,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,364 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:21,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:21,430 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:27:21,431 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,445 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,461 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,477 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,493 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,508 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,522 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:27:21,585 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,595 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,610 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,628 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,648 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,675 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,724 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:27:21,724 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:27:21,777 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:27:21,777 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,822 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:21,823 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:27:21,861 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 41 [2019-03-04 16:27:21,862 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,894 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:21,894 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-03-04 16:27:21,961 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 43 treesize of output 52 [2019-03-04 16:27:21,962 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:21,996 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:27:21,997 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:51 [2019-03-04 16:27:22,018 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:22,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:22,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:27:22,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:27:22,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:27:22,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:22,038 INFO L87 Difference]: Start difference. First operand 343 states and 2501 transitions. Second operand 10 states. [2019-03-04 16:27:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:27:22,872 INFO L93 Difference]: Finished difference Result 488 states and 3244 transitions. [2019-03-04 16:27:22,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:27:22,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:27:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:27:22,878 INFO L225 Difference]: With dead ends: 488 [2019-03-04 16:27:22,878 INFO L226 Difference]: Without dead ends: 486 [2019-03-04 16:27:22,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:27:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-03-04 16:27:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 391. [2019-03-04 16:27:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-03-04 16:27:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 2885 transitions. [2019-03-04 16:27:23,091 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 2885 transitions. Word has length 5 [2019-03-04 16:27:23,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:27:23,092 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 2885 transitions. [2019-03-04 16:27:23,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:27:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 2885 transitions. [2019-03-04 16:27:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:27:23,093 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:27:23,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:27:23,094 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:27:23,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:27:23,094 INFO L82 PathProgramCache]: Analyzing trace with hash 28954806, now seen corresponding path program 1 times [2019-03-04 16:27:23,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:27:23,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:27:23,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:23,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:23,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:27:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:23,173 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:23,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:27:23,173 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:27:23,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:27:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:27:23,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:27:23,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:27:23,194 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 24 treesize of output 27 [2019-03-04 16:27:23,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,204 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:27:23,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,211 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 29 treesize of output 31 [2019-03-04 16:27:23,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,221 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 31 treesize of output 33 [2019-03-04 16:27:23,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,238 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-03-04 16:27:23,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,250 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,261 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2019-03-04 16:27:23,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:27:23,326 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:27:23,327 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,343 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,358 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,372 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,389 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,402 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,418 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,478 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:27:23,479 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,481 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,488 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,499 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,518 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,547 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:27:23,594 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:23,595 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-03-04 16:27:23,640 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:27:23,641 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:27:23,719 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:23,720 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:152 [2019-03-04 16:27:23,843 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 88 treesize of output 125 [2019-03-04 16:27:23,850 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-03-04 16:27:24,376 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 113 [2019-03-04 16:27:24,378 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:24,650 INFO L309 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 29 dim-0 vars, and 7 xjuncts. [2019-03-04 16:27:24,650 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:455 [2019-03-04 16:27:25,850 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 238 DAG size of output: 143 [2019-03-04 16:27:25,924 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 67 treesize of output 72 [2019-03-04 16:27:25,924 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:26,161 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 67 treesize of output 97 [2019-03-04 16:27:26,163 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:26,370 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 67 treesize of output 76 [2019-03-04 16:27:26,371 INFO L309 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:26,534 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 96 [2019-03-04 16:27:26,535 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:27:26,664 INFO L309 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 4 dim-1 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2019-03-04 16:27:26,664 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 24 variables, input treesize:303, output treesize:249 [2019-03-04 16:27:30,963 WARN L181 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 149 DAG size of output: 109 [2019-03-04 16:27:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:27:30,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:27:30,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:27:30,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:27:30,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:27:30,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:27:30,985 INFO L87 Difference]: Start difference. First operand 391 states and 2885 transitions. Second operand 10 states. [2019-03-04 16:27:31,281 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-03-04 16:27:31,441 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 89 [2019-03-04 16:27:35,566 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-03-04 16:27:35,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:27:35,567 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:191) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 49 more [2019-03-04 16:27:35,571 INFO L168 Benchmark]: Toolchain (without parser) took 138367.18 ms. Allocated memory was 131.6 MB in the beginning and 727.7 MB in the end (delta: 596.1 MB). Free memory was 103.4 MB in the beginning and 627.3 MB in the end (delta: -523.9 MB). Peak memory consumption was 72.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:27:35,572 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.15 ms. Allocated memory is still 131.6 MB. Free memory is still 104.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:27:35,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.82 ms. Allocated memory is still 131.6 MB. Free memory was 103.2 MB in the beginning and 100.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:27:35,572 INFO L168 Benchmark]: Boogie Preprocessor took 24.34 ms. Allocated memory is still 131.6 MB. Free memory was 100.9 MB in the beginning and 99.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:27:35,573 INFO L168 Benchmark]: RCFGBuilder took 574.90 ms. Allocated memory is still 131.6 MB. Free memory was 99.6 MB in the beginning and 87.3 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:27:35,573 INFO L168 Benchmark]: TraceAbstraction took 137709.16 ms. Allocated memory was 131.6 MB in the beginning and 727.7 MB in the end (delta: 596.1 MB). Free memory was 87.1 MB in the beginning and 627.3 MB in the end (delta: -540.2 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. [2019-03-04 16:27:35,575 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 1.15 ms. Allocated memory is still 131.6 MB. Free memory is still 104.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.82 ms. Allocated memory is still 131.6 MB. Free memory was 103.2 MB in the beginning and 100.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.34 ms. Allocated memory is still 131.6 MB. Free memory was 100.9 MB in the beginning and 99.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 574.90 ms. Allocated memory is still 131.6 MB. Free memory was 99.6 MB in the beginning and 87.3 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 137709.16 ms. Allocated memory was 131.6 MB in the beginning and 727.7 MB in the end (delta: 596.1 MB). Free memory was 87.1 MB in the beginning and 627.3 MB in the end (delta: -540.2 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...